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:08Victor MerckléVictor MerckléScore: 77,170Success
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:0976,72948,532,18026,363,0002,027,0002,379,776
2Apr 27, 2026 16:0976,78145,712,86327,395,0001,014,0002,363,392
3Apr 27, 2026 16:0976,90049,688,53125,405,0003,048,0002,363,392
4Apr 27, 2026 16:0976,94844,780,85526,438,0002,033,0002,371,584
5Apr 27, 2026 16:0977,17047,077,57127,534,0001,019,0002,367,488
6Apr 27, 2026 16:0977,24545,582,49927,561,0001,020,0002,371,584
7Apr 27, 2026 16:0977,48651,120,40926,623,0002,047,0002,371,584
8Apr 27, 2026 16:0977,52443,409,14226,636,0002,048,0002,367,488
9Apr 27, 2026 16:0977,64345,166,45726,676,0002,052,0002,371,584