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 21, 2026 21:09olliecrowolliecrowScore: 62,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 21:1162,32143,717,55720,052,0003,007,0002,519,040
2Apr 21, 2026 21:1162,38943,845,47520,073,0003,011,0002,506,752
3Apr 21, 2026 21:1162,57037,407,73121,138,0002,013,0002,338,816
4Apr 21, 2026 21:1162,64040,340,13520,154,0003,023,0002,519,040
5Apr 21, 2026 21:1162,65440,929,79820,159,0003,023,0002,514,944
6Apr 21, 2026 21:1162,66445,190,90520,162,0003,024,0002,338,816
7Apr 21, 2026 21:1162,67542,601,26520,166,0003,024,0002,506,752
8Apr 21, 2026 21:1162,88646,030,42121,245,0002,023,0002,527,232
9Apr 21, 2026 21:1171,06447,464,16624,272,0002,022,0002,498,560