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 listAug 28, 2026 17:13Victor MerckléVictor MerckléScore: 56,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 17:1456,67029,073,21520,968,00002,113,536
2Aug 28, 2026 17:1456,74329,335,51819,967,0001,028,0002,113,536
3Aug 28, 2026 17:1456,77030,231,66519,974,0001,031,0002,113,536
4Aug 28, 2026 17:1456,85129,424,25220,001,0001,034,0002,113,536
5Aug 28, 2026 17:1456,85130,038,63320,002,0001,033,0002,113,536
6Aug 28, 2026 17:1456,86730,088,64420,002,0001,039,0002,113,536
7Aug 28, 2026 17:1457,00530,172,40420,082,0001,010,0002,113,536
8Aug 28, 2026 17:1457,01329,468,29520,056,0001,039,0002,113,536
9Aug 28, 2026 17:1457,04529,458,24220,098,0001,009,0002,113,536