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 listMay 11, 2026 23:53Victor MerckléVictor MerckléScore: 64,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:5464,51034,523,79422,789,0001,080,0002,113,536
2May 11, 2026 23:5464,52434,428,44022,798,0001,076,0002,113,536
3May 11, 2026 23:5464,63732,882,30022,801,0001,115,0002,113,536
4May 11, 2026 23:5464,69733,751,03522,837,0001,101,0002,113,536
5May 11, 2026 23:5464,70836,622,69422,854,0001,088,0002,113,536
6May 11, 2026 23:5464,72735,529,13822,856,0001,093,0002,113,536
7May 11, 2026 23:5465,00832,837,50922,968,0001,085,0002,113,536
8May 11, 2026 23:5465,05935,603,55722,980,0001,092,0002,113,536
9May 11, 2026 23:5465,10232,913,75422,989,0001,099,0002,113,536