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 12, 2026 05:09Josu San MartinJosu San MartinScore: 70,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 05:0970,78147,313,27925,182,0001,007,0002,289,664
2Jan 12, 2026 05:0970,88949,049,64925,221,0001,008,0002,367,488
3Jan 12, 2026 05:0971,22449,992,86525,340,0001,013,0002,289,664