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 12:39Victor MerckléVictor MerckléScore: 63,497Success
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 12:4063,18630,813,51222,371,0001,008,0002,117,632stderr
2Jun 24, 2026 12:4063,28631,040,03823,416,00002,117,632stderr
3Jun 24, 2026 12:4063,37831,509,61822,441,0001,009,0002,117,632stderr
4Jun 24, 2026 12:4063,43731,096,16323,472,00002,117,632stderr
5Jun 24, 2026 12:4063,49730,969,30522,468,0001,026,0002,117,632stderr
6Jun 24, 2026 12:4063,59131,181,61323,529,00002,117,632stderr
7Jun 24, 2026 12:4063,76231,449,58622,590,0001,002,0002,117,632stderr
8Jun 24, 2026 12:4063,82931,039,52123,617,00002,117,632stderr
9Jun 24, 2026 12:4063,98331,710,32223,674,00002,117,632stderr