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 9, 2026 21:08Victor MerckléVictor MerckléScore: 64,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:0964,32132,826,11322,746,0001,053,0002,113,536
2Jun 9, 2026 21:0964,35132,851,68522,754,0001,056,0002,113,536
3Jun 9, 2026 21:0964,37532,798,96222,754,0001,065,0002,113,536
4Jun 9, 2026 21:0964,43732,899,41222,805,0001,037,0002,113,536
5Jun 9, 2026 21:0964,46232,830,09422,799,0001,052,0002,113,536
6Jun 9, 2026 21:0964,48632,919,24822,814,0001,046,0002,113,536
7Jun 9, 2026 21:0964,79732,999,79422,916,0001,059,0002,113,536
8Jun 9, 2026 21:0964,82733,000,90922,933,0001,053,0002,113,536
9Jun 9, 2026 21:0964,83732,966,95222,937,0001,053,0002,113,536