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 23:31IlyaIlyaScore: 58,481Success
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 23:3658,32731,277,85520,458,0001,123,0002,113,536
2Jul 8, 2026 23:3658,37531,255,74720,461,0001,138,0002,113,536
3Jul 8, 2026 23:3658,43231,370,84120,499,0001,121,0002,113,536
4Jul 8, 2026 23:3658,44532,613,34820,488,0001,137,0002,113,536
5Jul 8, 2026 23:3658,48131,373,59420,521,0001,117,0002,113,536
6Jul 8, 2026 23:3658,59431,336,99520,564,0001,116,0002,113,536
7Jul 8, 2026 23:3658,87231,480,25420,554,0001,229,0002,113,536
8Jul 8, 2026 23:3621,523,7087,973,664,0667,814,989,000148,783,0002,113,536
9Jul 8, 2026 23:3621,640,4758,017,107,5637,853,761,000153,215,0002,113,536