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 listJun 30, 2026 17:08IlyaIlyaScore: 60,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:1060,00532,214,11220,984,0001,218,0002,113,536
2Jun 30, 2026 17:1060,17532,283,41321,050,0001,215,0002,113,536
3Jun 30, 2026 17:1060,23533,790,06721,043,0001,244,0002,113,536
4Jun 30, 2026 17:1060,70532,226,47121,266,0001,195,0002,113,536
5Jun 30, 2026 17:1060,98332,552,31521,361,0001,203,0002,113,536
6Jun 30, 2026 17:1020,871,7837,732,642,5067,564,674,000157,886,0002,113,536
7Jun 30, 2026 17:1021,033,1487,800,299,4997,629,456,000152,809,0002,113,536
8Jun 30, 2026 17:1021,110,7757,821,308,7097,654,525,000156,462,0002,113,536
9Jun 30, 2026 17:1021,181,5247,847,027,2757,678,685,000158,479,0002,113,536