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 listSep 20, 2026 15:14Andrew EpsteinAndrew EpsteinScore: 56,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:1655,98631,551,01020,715,000020,480
2Sep 20, 2026 15:1655,98629,651,83320,715,000020,480
3Sep 20, 2026 15:1656,10231,984,76920,758,000020,480
4Sep 20, 2026 15:1656,10530,952,43620,759,000020,480
5Sep 20, 2026 15:1656,14831,212,67120,775,000020,480
6Sep 20, 2026 15:1656,17830,708,96220,786,000020,480
7Sep 20, 2026 15:1656,22430,685,64920,803,000020,480
8Sep 20, 2026 15:1656,23731,918,88420,808,000020,480
9Sep 20, 2026 15:1656,24331,808,02620,810,000020,480