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:57Victor MerckléVictor MerckléScore: 64,710Success
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:5864,30532,584,52322,784,0001,009,0002,113,536
2May 11, 2026 23:5864,41832,580,58922,809,0001,026,0002,113,536
3May 11, 2026 23:5864,59734,840,47422,856,0001,045,0002,113,536
4May 11, 2026 23:5864,60832,688,95422,818,0001,087,0002,113,536
5May 11, 2026 23:5864,71033,757,57322,857,0001,086,0002,113,536
6May 11, 2026 23:5864,74534,885,84222,846,0001,110,0002,113,536
7May 11, 2026 23:5865,08133,048,95122,976,0001,104,0002,113,536
8May 11, 2026 23:5865,17035,414,09722,997,0001,116,0002,113,536
9May 11, 2026 23:5865,25634,565,78723,132,0001,013,0002,113,536