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:13IlyaIlyaScore: 59,478Success
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:1459,11831,347,12520,703,0001,171,0002,113,536
2Jun 29, 2026 21:1459,31031,354,11020,740,0001,205,0002,113,536
3Jun 29, 2026 21:1459,35431,872,75220,764,0001,197,0002,113,536
4Jun 29, 2026 21:1459,36231,892,06120,760,0001,204,0002,113,536
5Jun 29, 2026 21:1459,47831,924,56020,792,0001,215,0002,113,536
6Jun 29, 2026 21:1459,49131,904,11220,828,0001,184,0002,113,536
7Jun 29, 2026 21:1459,50032,008,37820,796,0001,219,0002,113,536
8Jun 29, 2026 21:1459,53731,932,52220,809,0001,220,0002,113,536
9Jun 29, 2026 21:1459,68131,936,93120,860,0001,222,0002,113,536