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 8, 2026 21:53IlyaIlyaScore: 58,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:5558,32131,270,20420,468,0001,111,0002,113,536
2Jul 8, 2026 21:5558,35931,271,34720,496,0001,097,0002,113,536
3Jul 8, 2026 21:5558,55431,340,74620,559,0001,106,0002,113,536
4Jul 8, 2026 21:5558,55931,302,98620,516,0001,151,0002,113,536
5Jul 8, 2026 21:5558,59431,370,76720,538,0001,142,0002,113,536
6Jul 8, 2026 21:5558,84031,451,05020,575,0001,196,0002,113,536
7Jul 8, 2026 21:5521,521,8187,972,966,3617,813,995,000149,078,0002,113,536
8Jul 8, 2026 21:5521,534,7917,977,984,6557,817,774,000150,099,0002,113,536
9Jul 8, 2026 21:5521,544,9437,983,403,2537,820,411,000151,218,0002,113,536