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 02:02Josu San MartinJosu San MartinScore: 69,797Success
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 02:0269,24156,045,01224,595,0001,024,0002,351,104
2Jan 13, 2026 02:0269,79753,699,03524,832,000993,0002,289,664
3Jan 13, 2026 02:0269,80350,274,00024,834,000993,0002,355,200