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: 60,970Success
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:4660,77231,697,75321,456,0001,030,0002,113,536
2May 17, 2026 11:4660,77532,930,96221,479,0001,008,0002,113,536
3May 17, 2026 11:4660,79134,225,77321,465,0001,028,0002,113,536
4May 17, 2026 11:4660,94834,371,45721,531,0001,020,0002,113,536
5May 17, 2026 11:4660,97033,518,72321,552,0001,007,0002,113,536
6May 17, 2026 11:4660,98632,279,44421,557,0001,008,0002,113,536
7May 17, 2026 11:4661,05932,025,26821,554,0001,038,0002,113,536
8May 17, 2026 11:4661,13531,494,39821,596,0001,024,0002,113,536
9May 17, 2026 11:4661,14331,427,53421,596,0001,027,0002,113,536