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 24, 2026 19:01Kevin HeaveyKevin HeaveyScore: 53,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:0353,86428,739,85619,930,000020,480
2Sep 24, 2026 19:0353,87528,712,91619,934,000020,480
3Sep 24, 2026 19:0353,92428,719,17719,952,000020,480
4Sep 24, 2026 19:0353,93228,665,06719,955,000020,480
5Sep 24, 2026 19:0353,97028,706,09619,969,000020,480
6Sep 24, 2026 19:0354,00028,661,75319,980,000020,480
7Sep 24, 2026 19:0354,02128,711,34019,988,000020,480
8Sep 24, 2026 19:0354,02428,766,60119,989,000020,480
9Sep 24, 2026 19:0354,10228,787,15920,018,000020,480