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 listApr 27, 2026 16:16Victor MerckléVictor MerckléScore: 77,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 16:1776,85648,515,91827,422,0001,015,0002,367,488
2Apr 27, 2026 16:1776,86447,962,21126,409,0002,031,0002,379,776
3Apr 27, 2026 16:1777,07044,539,46227,498,0001,018,0002,367,488
4Apr 27, 2026 16:1777,15645,400,98726,509,0002,039,0002,371,584
5Apr 27, 2026 16:1777,19445,073,35927,542,0001,020,0002,367,488
6Apr 27, 2026 16:1777,23251,037,08127,556,0001,020,0002,383,872
7Apr 27, 2026 16:1777,27548,920,47325,529,0003,063,0002,367,488
8Apr 27, 2026 16:1777,32949,477,95226,569,0002,043,0002,367,488
9Apr 27, 2026 16:1777,67245,741,56125,766,0002,973,0002,367,488