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,684Success
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:3271,44951,029,04125,420,0001,016,0002,355,200
2Jan 13, 2026 01:3271,68451,275,98825,503,0001,020,0002,363,392
3Jan 13, 2026 01:3271,74652,303,98925,525,0001,021,0002,289,664