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 09:03M-RochatM-RochatScore: 67,159Success
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 09:0466,84835,379,89123,705,0001,029,0002,113,536
2May 17, 2026 09:0466,86233,745,21223,721,0001,018,0002,113,536
3May 17, 2026 09:0466,92933,924,49423,741,0001,023,0002,113,536
4May 17, 2026 09:0466,99436,384,99623,778,0001,010,0002,113,536
5May 17, 2026 09:0467,15935,594,76723,833,0001,016,0002,113,536
6May 17, 2026 09:0467,16233,637,29623,843,0001,007,0002,113,536
7May 17, 2026 09:0467,34834,648,63623,912,0001,007,0002,113,536
8May 17, 2026 09:0467,54335,159,91723,983,0001,008,0002,113,536
9May 17, 2026 09:0467,54534,456,60423,980,0001,012,0002,113,536