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 listJul 7, 2026 10:25IlyaIlyaScore: 59,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:2758,90031,393,99120,673,0001,120,0002,113,536
2Jul 7, 2026 10:2758,90231,376,70420,691,0001,103,0002,113,536
3Jul 7, 2026 10:2758,97231,453,15020,632,0001,188,0002,113,536
4Jul 7, 2026 10:2759,11331,499,75420,725,0001,147,0002,113,536
5Jul 7, 2026 10:2759,14033,492,51520,706,0001,176,0002,113,536
6Jul 7, 2026 10:2759,16731,529,12420,709,0001,183,0002,113,536
7Jul 7, 2026 10:2759,22932,112,03620,728,0001,187,0002,113,536
8Jul 7, 2026 10:2759,25431,602,56820,723,0001,201,0002,113,536
9Jul 7, 2026 10:2759,34333,473,87120,759,0001,198,0002,113,536