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:05Andrew EpsteinAndrew EpsteinScore: 56,797Success
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:0656,64029,935,56119,953,0001,004,0002,117,632stderr
2Sep 20, 2026 15:0656,65930,613,05119,934,0001,030,0002,117,632stderr
3Sep 20, 2026 15:0656,67529,770,44319,926,0001,044,0002,117,632stderr
4Sep 20, 2026 15:0656,75429,807,82219,966,0001,033,0002,117,632stderr
5Sep 20, 2026 15:0656,79729,826,18819,969,0001,046,0002,117,632stderr
6Sep 20, 2026 15:0656,88630,525,63920,014,0001,034,0002,117,632stderr
7Sep 20, 2026 15:0656,88929,877,77320,008,0001,041,0002,117,632stderr
8Sep 20, 2026 15:0656,89429,902,84220,046,0001,005,0002,117,632stderr
9Sep 20, 2026 15:0656,95130,514,39920,057,0001,015,0002,117,632stderr