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 1, 2026 13:38IlyaIlyaScore: 21,584,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:4060,59131,878,74521,301,0001,118,0002,113,536
2Jul 1, 2026 13:4061,07532,602,68321,385,0001,213,0002,113,536
3Jul 1, 2026 13:4021,456,5977,948,940,5267,783,606,000155,335,0002,113,536
4Jul 1, 2026 13:4021,579,8437,994,296,1227,831,013,000153,529,0002,113,536
5Jul 1, 2026 13:4021,584,1357,996,319,1687,829,519,000156,611,0002,113,536
6Jul 1, 2026 13:4021,628,7168,012,291,5617,845,432,000157,193,0002,113,536
7Jul 1, 2026 13:4021,699,0298,038,700,7337,874,479,000154,162,0002,113,536
8Jul 1, 2026 13:4021,707,5218,041,529,2727,873,519,000158,264,0002,113,536
9Jul 1, 2026 13:4021,749,0868,056,890,5487,893,449,000153,713,0002,113,536