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 listJan 13, 2026 01:32Josu San MartinJosu San MartinScore: 71,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:3270,85746,507,49125,209,0001,008,0002,363,392
2Jan 13, 2026 01:3271,25750,719,88026,365,00002,351,104
3Jan 13, 2026 01:3271,65447,475,70625,493,0001,019,0002,289,664