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 00:13Josu San MartinJosu San MartinScore: 70,414Success
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 00:1370,23250,345,17524,987,000999,0002,289,664
2Jan 13, 2026 00:1370,41455,813,01124,049,0002,004,0002,289,664
3Jan 13, 2026 00:1370,50052,094,99724,079,0002,006,0002,351,104