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:56Victor MerckléVictor MerckléScore: 56,278Success
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:5756,18129,837,69419,755,0001,032,0002,113,536
2Aug 28, 2026 16:5756,19429,857,26719,790,0001,002,0002,113,536
3Aug 28, 2026 16:5756,21828,917,46419,762,0001,039,0002,113,536
4Aug 28, 2026 16:5756,23229,195,58119,778,0001,028,0002,113,536
5Aug 28, 2026 16:5756,27829,434,31019,815,0001,008,0002,113,536
6Aug 28, 2026 16:5756,31628,982,90919,826,0001,011,0002,113,536
7Aug 28, 2026 16:5756,39729,968,05919,859,0001,008,0002,113,536
8Aug 28, 2026 16:5756,42728,987,38319,845,0001,033,0002,113,536
9Aug 28, 2026 16:5756,47229,031,23419,856,0001,039,0002,113,536