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 21:08IlyaIlyaScore: 59,610Success
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 21:1059,13231,418,73420,766,0001,113,0002,113,536
2Jun 29, 2026 21:1059,34831,496,93120,777,0001,182,0002,113,536
3Jun 29, 2026 21:1059,43731,955,98620,786,0001,206,0002,113,536
4Jun 29, 2026 21:1059,58632,047,56020,830,0001,217,0002,113,536
5Jun 29, 2026 21:1059,61031,987,39620,853,0001,203,0002,113,536
6Jun 29, 2026 21:1059,65431,997,90520,859,0001,213,0002,113,536
7Jun 29, 2026 21:1059,70032,053,02420,846,0001,243,0002,113,536
8Jun 29, 2026 21:1059,72732,021,12420,880,0001,219,0002,113,536
9Jun 29, 2026 21:1059,81332,081,41120,897,0001,234,0002,113,536