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:06Victor MerckléVictor MerckléScore: 77,232Success
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:0676,68641,938,88227,361,0001,013,0002,375,680
2Apr 27, 2026 16:0676,74050,070,65527,380,0001,014,0002,367,488
3Apr 27, 2026 16:0677,03247,568,02327,485,0001,017,0002,367,488
4Apr 27, 2026 16:0677,06438,739,98527,496,0001,018,0002,555,904
5Apr 27, 2026 16:0677,23244,726,55426,535,0002,041,0002,363,392
6Apr 27, 2026 16:0677,25944,744,41627,566,0001,020,0002,367,488
7Apr 27, 2026 16:0677,40044,104,73427,616,0001,022,0002,555,904
8Apr 27, 2026 16:0677,43243,473,08126,604,0002,046,0002,441,216
9Apr 27, 2026 16:0677,56743,506,71127,675,0001,025,0002,363,392