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 listMay 17, 2026 11:40M-RochatM-RochatScore: 60,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:4360,81631,786,70121,483,0001,019,0002,113,536
2May 17, 2026 11:4360,82732,111,80021,487,0001,019,0002,113,536
3May 17, 2026 11:4360,90532,176,54421,502,0001,033,0002,113,536
4May 17, 2026 11:4360,92134,912,38121,516,0001,025,0002,113,536
5May 17, 2026 11:4360,97034,247,49021,527,0001,032,0002,113,536
6May 17, 2026 11:4361,00834,431,33221,542,0001,031,0002,113,536
7May 17, 2026 11:4361,15133,569,92221,592,0001,034,0002,113,536
8May 17, 2026 11:4361,19132,441,03921,620,0001,021,0002,113,536
9May 17, 2026 11:4361,26432,435,92221,636,0001,032,0002,113,536