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 21:08Victor MerckléVictor MerckléScore: 64,605Success
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 21:0964,40833,542,59222,786,0001,045,0002,113,536
2May 11, 2026 21:0964,45934,762,59022,811,0001,039,0002,113,536
3May 11, 2026 21:0964,55434,411,23522,793,0001,092,0002,113,536
4May 11, 2026 21:0964,56732,892,37422,803,0001,087,0002,113,536
5May 11, 2026 21:0964,60532,698,68722,808,0001,096,0002,113,536
6May 11, 2026 21:0964,62133,459,57322,834,0001,076,0002,113,536
7May 11, 2026 21:0964,81033,518,44122,976,0001,004,0002,113,536
8May 11, 2026 21:0964,82934,858,25722,965,0001,022,0002,113,536
9May 11, 2026 21:0964,82933,231,73522,969,0001,018,0002,113,536