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 listMar 26, 2026 10:23Dominique GarmierDominique GarmierScore: 9,586,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:239,472,4593,533,462,2543,502,812,0001,998,0002,281,472
2Mar 26, 2026 10:239,586,6573,569,891,9483,546,064,000999,0002,461,696
3Mar 26, 2026 10:239,599,8863,577,976,1553,550,959,000999,0002,281,472