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:12Andrew EpsteinAndrew EpsteinScore: 56,029Success
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:1255,88329,475,23220,677,000020,480
2Sep 20, 2026 15:1255,89429,575,70720,681,000020,480
3Sep 20, 2026 15:1255,97029,356,56420,709,000020,480
4Sep 20, 2026 15:1255,99129,546,49920,717,000020,480
5Sep 20, 2026 15:1256,02929,584,28420,731,000020,480
6Sep 20, 2026 15:1256,09729,608,10320,756,000020,480
7Sep 20, 2026 15:1256,11329,616,09820,762,000020,480
8Sep 20, 2026 15:1256,12729,602,78520,767,000020,480
9Sep 20, 2026 15:1256,14329,562,11420,773,000020,480