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 listJan 12, 2026 04:26Josu San MartinJosu San MartinScore: 70,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:2670,45152,663,40124,062,0002,005,0002,363,392
2Jan 12, 2026 04:2670,48150,513,24225,075,0001,003,0002,359,296
3Jan 12, 2026 04:2670,53254,377,99124,090,0002,007,0002,371,584
4Jan 12, 2026 04:2670,71949,134,16624,154,0002,012,0002,289,664
5Jan 12, 2026 04:2670,84151,671,25124,195,0002,016,0002,289,664
6Jan 12, 2026 04:2670,84352,647,06624,196,0002,016,0002,363,392
7Jan 12, 2026 04:2670,85446,464,27824,200,0002,016,0002,469,888
8Jan 12, 2026 04:2670,86251,564,14424,203,0002,016,0002,289,664
9Jan 12, 2026 04:2671,02748,692,47825,270,0001,010,0002,359,296