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 15:43Victor MerckléVictor MerckléScore: 77,272Success
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 15:4376,84341,122,00625,386,0003,046,0002,371,584
2Apr 27, 2026 15:4376,97541,800,11026,447,0002,034,0002,367,488
3Apr 27, 2026 15:4377,00544,931,66226,457,0002,035,0002,363,392
4Apr 27, 2026 15:4377,19747,026,74027,543,0001,020,0002,371,584
5Apr 27, 2026 15:4377,27245,296,47527,570,0001,021,0002,359,296
6Apr 27, 2026 15:4377,54349,341,99726,642,0002,049,0002,363,392
7Apr 27, 2026 15:4377,54546,534,57626,643,0002,049,0002,359,296
8Apr 27, 2026 15:4377,68145,479,72926,689,0002,053,0002,363,392
9Apr 27, 2026 15:4377,77849,034,21426,794,0001,984,0002,420,736