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 listMay 4, 2026 05:49Josu San MartinJosu San MartinScore: 59,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 05:5159,25938,337,52120,810,0001,116,0002,445,312
2May 4, 2026 05:5159,27239,362,79020,822,0001,109,0002,441,216
3May 4, 2026 05:5159,31339,244,38220,834,0001,112,0002,437,120
4May 4, 2026 05:5159,32135,276,90020,866,0001,083,0002,437,120
5May 4, 2026 05:5159,38138,207,86120,874,0001,097,0002,424,832
6May 4, 2026 05:5159,40237,217,19520,868,0001,111,0002,437,120
7May 4, 2026 05:5159,43737,002,28920,902,0001,090,0002,437,120
8May 4, 2026 05:5159,49140,454,51420,897,0001,115,0002,441,216
9May 4, 2026 05:5159,50235,851,48820,897,0001,119,0002,453,504