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 listMar 15, 2026 19:00Elijah KinElijah KinScore: 243,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:00242,259122,631,49845,322,00044,314,0002,269,184
2Mar 15, 2026 19:00242,635113,683,81941,895,00047,880,0002,367,488
3Mar 15, 2026 19:00242,646114,562,87445,887,00043,892,0002,367,488
4Mar 15, 2026 19:00242,895115,118,24945,934,00043,937,0002,367,488
5Mar 15, 2026 19:00243,827112,878,94344,106,00046,110,0002,375,680
6Mar 15, 2026 19:00245,349120,815,31046,886,00043,893,0002,371,584
7Mar 15, 2026 19:00245,424117,760,18938,917,00051,890,0002,273,280
8Mar 15, 2026 19:00246,089113,998,79250,029,00041,024,0002,367,488
9Mar 15, 2026 19:00247,176117,659,68441,205,00050,250,0002,375,680