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 18, 2026 06:12Charles CabergsCharles CabergsScore: 92,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 06:1291,46558,909,54031,852,0001,990,0002,260,992
2Apr 18, 2026 06:1291,77660,055,39332,959,000998,0002,519,040
3Apr 18, 2026 06:1292,05163,727,37233,058,0001,001,0002,383,872
4Apr 18, 2026 06:1292,09561,878,45632,071,0002,004,0002,371,584
5Apr 18, 2026 06:1292,23066,603,26833,122,0001,003,0002,379,776
6Apr 18, 2026 06:1292,31661,467,04233,153,0001,004,0002,367,488
7Apr 18, 2026 06:1292,54661,685,86630,214,0004,028,0002,387,968
8Apr 18, 2026 06:1292,68158,386,40531,267,0003,025,0002,519,040
9Apr 18, 2026 06:1293,17861,347,11933,462,0001,014,0002,519,040