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 10, 2026 14:56Victor MerckléVictor MerckléScore: 64,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 14:5763,76232,714,22122,469,0001,123,0002,117,632stderr
2Jun 10, 2026 14:5764,06432,746,89822,588,0001,116,0002,117,632stderr
3Jun 10, 2026 14:5764,33532,841,04122,669,0001,135,0002,117,632stderr
4Jun 10, 2026 14:5764,41332,887,37822,725,0001,108,0002,117,632stderr
5Jun 10, 2026 14:5764,42932,828,54722,730,0001,109,0002,117,632stderr
6Jun 10, 2026 14:5764,78133,400,61222,826,0001,143,0002,117,632stderr
7Jun 10, 2026 14:5764,82933,093,78222,879,0001,108,0002,117,632stderr
8Jun 10, 2026 14:5765,16233,154,49422,985,0001,125,0002,117,632stderr
9Jun 10, 2026 14:5765,32933,183,51823,031,0001,141,0002,117,632stderr