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 listAug 28, 2026 16:24Victor MerckléVictor MerckléScore: 57,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:2557,59129,473,89121,309,00002,113,536
2Aug 28, 2026 16:2557,62430,374,25220,288,0001,033,0002,113,536
3Aug 28, 2026 16:2557,65929,796,20521,334,00002,113,536
4Aug 28, 2026 16:2557,68630,397,46920,310,0001,034,0002,113,536
5Aug 28, 2026 16:2557,81029,534,17220,352,0001,038,0002,113,536
6Aug 28, 2026 16:2557,82429,535,74620,367,0001,028,0002,113,536
7Aug 28, 2026 16:2557,99430,539,79420,426,0001,032,0002,113,536
8Aug 28, 2026 16:2558,01829,843,73920,462,0001,005,0002,113,536
9Aug 28, 2026 16:2558,23730,696,60020,543,0001,005,0002,113,536