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 07:11M-RochatM-RochatScore: 74,724Success
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 07:1174,60536,981,09426,336,0001,268,0002,113,536
2May 16, 2026 07:1174,61636,228,87426,583,0001,025,0002,113,536
3May 16, 2026 07:1174,62136,656,43326,589,0001,021,0002,113,536
4May 16, 2026 07:1174,67537,193,49126,609,0001,021,0002,113,536
5May 16, 2026 07:1174,72438,141,66526,624,0001,024,0002,113,536
6May 16, 2026 07:1174,78937,371,07626,640,0001,032,0002,113,536
7May 16, 2026 07:1174,95136,830,96926,453,0001,279,0002,113,536
8May 16, 2026 07:1175,04838,125,03126,497,0001,271,0002,113,536
9May 16, 2026 07:1175,16736,955,03426,606,0001,206,0002,113,536