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 listFeb 5, 2026 22:15lipapipalipapipaScore: 82,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 22:1581,97660,212,87728,309,0002,022,0002,281,472
2Feb 5, 2026 22:1582,30853,453,72227,409,0003,045,0002,281,472
3Feb 5, 2026 22:1582,56253,830,74928,512,0002,036,0002,281,472