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:44M-RochatM-RochatScore: 61,205Success
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:4761,00532,252,03021,544,0001,028,0002,113,536
2May 17, 2026 11:4761,06731,410,46421,583,0001,012,0002,113,536
3May 17, 2026 11:4761,12731,628,04221,583,0001,034,0002,113,536
4May 17, 2026 11:4761,20032,835,64921,621,0001,023,0002,113,536
5May 17, 2026 11:4761,20531,361,57821,626,0001,020,0002,113,536
6May 17, 2026 11:4761,22431,479,98121,641,0001,012,0002,113,536
7May 17, 2026 11:4761,22733,492,45221,641,0001,013,0002,113,536
8May 17, 2026 11:4761,25633,875,99221,650,0001,015,0002,113,536
9May 17, 2026 11:4761,28634,918,06421,654,0001,022,0002,113,536