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 5, 2026 13:15Victor MerckléVictor MerckléScore: 64,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:1664,10532,819,78322,661,0001,058,0002,113,536
2Jun 5, 2026 13:1664,30532,866,94722,731,0001,062,0002,113,536
3Jun 5, 2026 13:1664,31332,940,43522,661,0001,135,0002,113,536
4Jun 5, 2026 13:1664,35432,869,91322,685,0001,126,0002,113,536
5Jun 5, 2026 13:1664,47832,968,08222,726,0001,131,0002,113,536
6Jun 5, 2026 13:1664,48632,986,01522,725,0001,135,0002,113,536
7Jun 5, 2026 13:1664,66432,991,39922,856,0001,070,0002,113,536
8Jun 5, 2026 13:1664,78133,016,62922,830,0001,139,0002,113,536
9Jun 5, 2026 13:1664,89133,121,90422,856,0001,154,0002,113,536