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 21:28IlyaIlyaScore: 59,154Success
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 21:3058,79131,252,78920,665,0001,088,0002,113,536
2Jun 30, 2026 21:3058,87831,193,42420,685,0001,100,0002,113,536
3Jun 30, 2026 21:3059,01031,257,68020,735,0001,099,0002,113,536
4Jun 30, 2026 21:3059,13731,379,89220,677,0001,204,0002,113,536
5Jun 30, 2026 21:3059,15431,834,12120,682,0001,205,0002,113,536
6Jun 30, 2026 21:3059,15931,314,11120,704,0001,185,0002,113,536
7Jun 30, 2026 21:3059,29431,488,07820,761,0001,178,0002,113,536
8Jun 30, 2026 21:3059,30231,957,69420,745,0001,197,0002,113,536
9Jun 30, 2026 21:3059,42431,985,01520,800,0001,187,0002,113,536