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 18:33M-RochatM-RochatScore: 59,683Success
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 18:3559,46732,408,95120,859,0001,144,0002,113,536
2May 18, 2026 18:3559,49131,249,83220,865,0001,147,0002,113,536
3May 18, 2026 18:3559,58632,929,72020,898,0001,149,0002,113,536
4May 18, 2026 18:3559,63231,471,31720,890,0001,174,0002,113,536
5May 18, 2026 18:3559,68331,285,61621,046,0001,037,0002,113,536
6May 18, 2026 18:3559,72433,498,57521,086,0001,012,0002,113,536
7May 18, 2026 18:3559,79733,383,23720,968,0001,157,0002,113,536
8May 18, 2026 18:3559,85432,810,56720,990,0001,156,0002,113,536
9May 18, 2026 18:3559,97833,339,04821,143,0001,049,0002,113,536