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 16, 2026 16:35M-RochatM-RochatScore: 67,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:3767,33236,680,69023,906,0001,007,0002,113,536
2May 16, 2026 16:3767,37835,498,60923,918,0001,012,0002,113,536
3May 16, 2026 16:3767,62435,735,02224,000,0001,021,0002,113,536
4May 16, 2026 16:3767,67834,464,84624,018,0001,023,0002,113,536
5May 16, 2026 16:3767,73735,769,89624,015,0001,048,0002,113,536
6May 16, 2026 16:3767,99435,924,54524,143,0001,015,0002,113,536
7May 16, 2026 16:3768,16734,300,35124,187,0001,035,0002,113,536
8May 16, 2026 16:3768,32436,079,63724,237,0001,043,0002,113,536
9May 16, 2026 16:3768,96235,357,92524,471,0001,045,0002,113,536