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 18, 2026 05:13M-RochatM-RochatScore: 59,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 05:1559,62933,317,91921,000,0001,063,0002,113,536
2May 18, 2026 05:1559,69733,647,93921,025,0001,063,0002,113,536
3May 18, 2026 05:1559,73233,431,75821,042,0001,059,0002,113,536
4May 18, 2026 05:1559,83232,314,04121,074,0001,064,0002,113,536
5May 18, 2026 05:1559,86231,320,92620,997,0001,152,0002,113,536
6May 18, 2026 05:1560,00233,081,85821,047,0001,154,0002,113,536
7May 18, 2026 05:1560,04332,647,62321,067,0001,149,0002,113,536
8May 18, 2026 05:1560,11031,607,59921,129,0001,112,0002,113,536
9May 18, 2026 05:1560,27833,344,33821,188,0001,115,0002,113,536