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 listSep 20, 2026 15:17Andrew EpsteinAndrew EpsteinScore: 56,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:2256,63529,779,98920,955,000024,576
2Sep 20, 2026 15:2256,65631,349,71620,963,000024,576
3Sep 20, 2026 15:2256,67529,727,54220,970,000024,576
4Sep 20, 2026 15:2256,74029,698,07620,994,000024,576
5Sep 20, 2026 15:2256,74329,808,94320,995,000024,576
6Sep 20, 2026 15:2256,77829,827,07721,008,000024,576
7Sep 20, 2026 15:2256,87229,826,57521,043,000024,576
8Sep 20, 2026 15:2256,87529,794,07021,044,000024,576
9Sep 20, 2026 15:2256,93529,942,72721,066,000024,576