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 listApr 27, 2026 13:59Charles CabergsCharles CabergsScore: 72,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 14:0072,45645,172,14224,824,0001,985,0002,355,200
2Apr 27, 2026 14:0072,52145,949,44523,852,0002,981,0002,355,200
3Apr 27, 2026 14:0072,52941,962,97624,849,0001,987,0002,367,488
4Apr 27, 2026 14:0072,59150,069,20924,870,0001,989,0002,359,296
5Apr 27, 2026 14:0072,61043,238,02525,871,000995,0002,359,296
6Apr 27, 2026 14:0072,71845,081,06723,917,0002,989,0002,367,488
7Apr 27, 2026 14:0072,82948,580,31124,951,0001,996,0002,363,392
8Apr 27, 2026 14:0072,94844,627,03023,992,0002,999,0002,424,832
9Apr 27, 2026 14:0072,99743,476,52924,008,0003,001,0002,359,296