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 14:44Andrew EpsteinAndrew EpsteinScore: 1,855,129Success
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 14:451,851,013695,187,804683,857,0001,018,0002,117,632stderr
2Sep 20, 2026 14:451,852,032695,697,598684,251,0001,001,0002,117,632stderr
3Sep 20, 2026 14:451,852,148696,380,495683,260,0002,035,0002,117,632stderr
4Sep 20, 2026 14:451,853,918696,310,472684,941,0001,009,0002,117,632stderr
5Sep 20, 2026 14:451,855,129696,955,875685,391,0001,007,0002,117,632stderr
6Sep 20, 2026 14:451,855,137696,610,688685,393,0001,008,0002,117,632stderr
7Sep 20, 2026 14:451,859,894699,033,126687,161,0001,000,0002,117,632stderr
8Sep 20, 2026 14:451,860,527698,665,449687,387,0001,008,0002,117,632stderr
9Sep 20, 2026 14:451,860,851702,975,610687,460,0001,055,0002,117,632stderr