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 listJun 12, 2026 02:16Victor MerckléVictor MerckléScore: 66,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:2066,42733,586,04623,424,0001,154,0002,134,016
2Jun 12, 2026 02:2066,48133,606,65723,452,0001,146,0002,129,920
3Jun 12, 2026 02:2066,68333,694,05323,517,0001,156,0002,129,920
4Jun 12, 2026 02:2066,74533,743,38723,555,0001,141,0002,129,920
5Jun 12, 2026 02:2066,91833,717,28423,622,0001,138,0002,129,920
6Jun 12, 2026 02:2066,93733,807,30223,616,0001,151,0002,129,920
7Jun 12, 2026 02:2067,02433,700,54523,652,0001,147,0002,174,976
8Jun 12, 2026 02:2067,28933,742,54123,748,0001,149,0002,174,976
9Jun 12, 2026 02:2067,30233,929,64123,763,0001,139,0002,174,976