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 20:57IlyaIlyaScore: 59,148Success
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:5858,89131,761,63620,654,0001,136,0002,113,536
2Jun 29, 2026 20:5858,95431,709,93520,714,0001,099,0002,113,536
3Jun 29, 2026 20:5859,03231,896,89820,636,0001,206,0002,113,536
4Jun 29, 2026 20:5859,13531,790,71220,682,0001,198,0002,113,536
5Jun 29, 2026 20:5859,14831,364,64720,705,0001,180,0002,113,536
6Jun 29, 2026 20:5859,15631,363,49720,686,0001,202,0002,113,536
7Jun 29, 2026 20:5859,15631,770,94020,677,0001,211,0002,113,536
8Jun 29, 2026 20:5859,23233,432,27720,706,0001,210,0002,113,536
9Jun 29, 2026 20:5859,40234,070,49220,748,0001,231,0002,113,536