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 24, 2026 23:18Victor MerckléVictor MerckléScore: 76,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:1876,27837,304,31826,971,0001,252,0002,117,632stderr
2Jun 24, 2026 23:1876,41337,349,57227,023,0001,250,0002,117,632stderr
3Jun 24, 2026 23:1876,43537,368,43627,013,0001,268,0002,117,632stderr
4Jun 24, 2026 23:1876,55937,426,67327,300,0001,027,0002,117,632stderr
5Jun 24, 2026 23:1876,58937,414,45527,102,0001,236,0002,117,632stderr
6Jun 24, 2026 23:1876,78637,453,43327,380,0001,031,0002,117,632stderr
7Jun 24, 2026 23:1876,90037,540,23827,164,0001,289,0002,117,632stderr
8Jun 24, 2026 23:1877,05437,645,44327,488,0001,022,0002,117,632stderr
9Jun 24, 2026 23:1877,25137,683,16927,318,0001,265,0002,117,632stderr