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 listJul 8, 2026 21:50IlyaIlyaScore: 58,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:5158,40231,173,87220,469,0001,140,0002,113,536
2Jul 8, 2026 21:5158,41831,270,06320,483,0001,132,0002,113,536
3Jul 8, 2026 21:5158,55133,228,35020,558,0001,106,0002,113,536
4Jul 8, 2026 21:5158,58331,369,50420,549,0001,127,0002,113,536
5Jul 8, 2026 21:5158,65131,420,73820,542,0001,159,0002,113,536
6Jul 8, 2026 21:5158,90533,515,03220,580,0001,215,0002,113,536
7Jul 8, 2026 21:5158,92132,006,64220,590,0001,211,0002,113,536
8Jul 8, 2026 21:5121,517,6677,971,976,2157,810,231,000151,306,0002,113,536
9Jul 8, 2026 21:5121,609,7298,006,531,0657,841,445,000154,155,0002,113,536