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:23Victor MerckléVictor MerckléScore: 71,167Success
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:2370,95135,364,33725,232,0001,020,0002,117,632stderr
2Jun 24, 2026 23:2370,98135,368,93624,985,0001,278,0002,117,632stderr
3Jun 24, 2026 23:2371,08935,399,03425,283,0001,020,0002,117,632stderr
4Jun 24, 2026 23:2371,11635,469,64925,290,0001,023,0002,117,632stderr
5Jun 24, 2026 23:2371,16735,447,03325,041,0001,291,0002,117,632stderr
6Jun 24, 2026 23:2371,18635,403,92325,316,0001,023,0002,117,632stderr
7Jun 24, 2026 23:2371,20835,414,12125,326,0001,021,0002,117,632stderr
8Jun 24, 2026 23:2371,22135,533,52225,329,0001,023,0002,117,632stderr
9Jun 24, 2026 23:2371,28135,968,62425,351,0001,023,0002,117,632stderr