TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listAug 14, 2022 19:38Franek KortaFranek KortaScore: 159,176Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 19:38155,946118,035,64557,700,14002,170,880
2Aug 14, 2022 19:38159,176119,094,57958,894,97202,277,376
3Aug 14, 2022 19:38159,901123,266,44759,163,54602,277,376