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 listMar 4, 2026 02:32Josu San MartinJosu San MartinScore: 71,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 02:3270,88451,749,98724,210,0002,017,0002,306,048
2Mar 4, 2026 02:3271,25449,371,62224,336,0002,028,0002,318,336
3Mar 4, 2026 02:3271,71951,196,14525,516,0001,020,0002,445,312