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 listSep 9, 2025 21:27Aleksei ShahoikaAleksei ShahoikaScore: 86,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2025 21:2785,35760,449,81430,564,0001,018,0002,273,280
2Sep 9, 2025 21:2785,61664,786,22630,657,0001,021,0002,277,376
3Sep 9, 2025 21:2785,91457,536,81330,795,000993,0002,285,568
4Sep 9, 2025 21:2785,96259,331,19630,813,000993,0002,265,088
5Sep 9, 2025 21:2786,00357,177,62329,833,0001,988,0002,285,568
6Sep 9, 2025 21:2786,02256,791,13129,839,0001,989,0002,285,568
7Sep 9, 2025 21:2786,03861,223,41130,840,000994,0002,265,088
8Sep 9, 2025 21:2786,12256,209,45330,870,000995,0002,285,568
9Sep 9, 2025 21:2786,19552,608,44730,896,000996,0002,375,680