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 11, 2026 16:26Victor MerckléVictor MerckléScore: 78,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:2778,18137,846,44627,905,0001,022,0002,113,536
2May 11, 2026 16:2778,30037,520,62027,928,0001,043,0002,113,536
3May 11, 2026 16:2778,41337,729,03528,007,0001,006,0002,113,536
4May 11, 2026 16:2778,47237,779,82728,026,0001,009,0002,113,536
5May 11, 2026 16:2778,84339,857,03428,168,0001,004,0002,113,536
6May 11, 2026 16:2778,89139,591,40728,178,0001,012,0002,113,536
7May 11, 2026 16:2778,90037,917,09628,175,0001,018,0002,113,536
8May 11, 2026 16:2778,92454,069,26628,098,0001,104,0002,113,536
9May 11, 2026 16:2779,40051,159,97828,257,0001,121,0002,113,536