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 23:03Victor MerckléVictor MerckléScore: 64,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 11, 2026 23:0464,43734,334,26122,829,0001,013,0002,113,536
2May 11, 2026 23:0464,54035,518,69922,794,0001,086,0002,113,536
3May 11, 2026 23:0464,65135,396,13822,819,0001,102,0002,113,536
4May 11, 2026 23:0464,71334,884,38722,850,0001,094,0002,113,536
5May 11, 2026 23:0464,73733,014,26722,797,0001,156,0002,113,536
6May 11, 2026 23:0464,77834,843,57822,867,0001,101,0002,113,536
7May 11, 2026 23:0465,05433,140,64422,979,0001,091,0002,113,536
8May 11, 2026 23:0465,07834,721,75422,978,0001,101,0002,113,536
9May 11, 2026 23:0465,15634,096,59322,994,0001,114,0002,113,536