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 2, 2026 12:24IlyaIlyaScore: 59,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:2959,41031,551,95620,825,0001,157,0002,113,536
2Jul 2, 2026 12:2959,41331,523,55620,801,0001,182,0002,113,536
3Jul 2, 2026 12:2959,42431,511,93620,772,0001,215,0002,113,536
4Jul 2, 2026 12:2959,48632,032,36320,799,0001,211,0002,113,536
5Jul 2, 2026 12:2959,55431,578,50320,850,0001,185,0002,113,536
6Jul 2, 2026 12:2959,65431,969,06320,878,0001,194,0002,113,536
7Jul 2, 2026 12:2959,65932,064,32820,870,0001,204,0002,113,536
8Jul 2, 2026 12:2959,71633,284,81620,856,0001,239,0002,113,536
9Jul 2, 2026 12:2959,93731,647,07221,144,0001,033,0002,113,536