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 13:40IlyaIlyaScore: 61,097Success
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 13:4260,74831,936,53421,393,0001,084,0002,113,536
2Jun 29, 2026 13:4260,83231,956,64021,412,0001,096,0002,113,536
3Jun 29, 2026 13:4260,99732,121,24621,447,0001,122,0002,113,536
4Jun 29, 2026 13:4261,07232,084,40421,377,0001,220,0002,113,536
5Jun 29, 2026 13:4261,09732,012,17721,403,0001,203,0002,113,536
6Jun 29, 2026 13:4261,27232,400,56121,494,0001,177,0002,113,536
7Jun 29, 2026 13:4261,48132,502,17621,511,0001,237,0002,113,536
8Jun 29, 2026 13:4261,48632,700,53021,545,0001,205,0002,113,536
9Jun 29, 2026 13:4261,55432,690,43721,556,0001,219,0002,113,536