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:26Josu San MartinJosu San MartinScore: 78,346Success
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:2678,31653,639,52326,979,0001,998,0002,281,472
2Jan 13, 2026 00:2678,34654,909,73227,989,000999,0002,281,472
3Jan 13, 2026 00:2678,60056,882,47727,077,0002,005,0002,281,472