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:53M-RochatM-RochatScore: 60,356Success
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:5560,12731,026,20821,242,0001,005,0002,113,536
2May 17, 2026 11:5560,22731,242,99421,261,0001,023,0002,113,536
3May 17, 2026 11:5560,23231,159,03221,242,0001,044,0002,113,536
4May 17, 2026 11:5560,34533,111,63221,289,0001,039,0002,113,536
5May 17, 2026 11:5560,35633,241,65621,229,0001,103,0002,113,536
6May 17, 2026 11:5560,36232,693,87521,288,0001,046,0002,113,536
7May 17, 2026 11:5560,39731,940,01021,313,0001,034,0002,113,536
8May 17, 2026 11:5560,41331,381,87621,345,0001,008,0002,113,536
9May 17, 2026 11:5560,57832,534,31921,325,0001,089,0002,113,536