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 29, 2026 19:59IlyaIlyaScore: 60,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:0059,90231,576,07421,072,0001,092,0002,113,536
2Jun 29, 2026 20:0059,96431,675,37621,081,0001,106,0002,113,536
3Jun 29, 2026 20:0060,02131,686,27321,097,0001,111,0002,113,536
4Jun 29, 2026 20:0060,04331,709,90221,099,0001,117,0002,113,536
5Jun 29, 2026 20:0060,04331,643,98121,109,0001,107,0002,113,536
6Jun 29, 2026 20:0060,20831,740,31521,125,0001,152,0002,113,536
7Jun 29, 2026 20:0060,27831,861,35121,182,0001,121,0002,113,536
8Jun 29, 2026 20:0060,27831,820,79621,121,0001,182,0002,113,536
9Jun 29, 2026 20:0060,55932,346,99921,174,0001,233,0002,113,536