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 7, 2026 02:37Victor MerckléVictor MerckléScore: 64,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 02:3963,74532,704,57622,519,0001,067,0002,113,536
2Jun 7, 2026 02:3963,96432,803,52722,512,0001,155,0002,113,536
3Jun 7, 2026 02:3963,97532,706,82322,536,0001,135,0002,113,536
4Jun 7, 2026 02:3964,08332,818,13022,577,0001,134,0002,113,536
5Jun 7, 2026 02:3964,08632,779,70822,574,0001,138,0002,113,536
6Jun 7, 2026 02:3964,14832,835,76622,579,0001,156,0002,113,536
7Jun 7, 2026 02:3964,33232,908,07122,727,0001,076,0002,113,536
8Jun 7, 2026 02:3964,49732,986,59622,711,0001,153,0002,113,536
9Jun 7, 2026 02:3964,52733,014,19222,733,0001,142,0002,113,536