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 25, 2026 22:33IlyaIlyaScore: 64,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:3464,15933,019,46222,626,0001,113,0002,113,536
2Jun 25, 2026 22:3464,23733,010,35122,652,0001,116,0002,113,536
3Jun 25, 2026 22:3464,43533,044,08622,709,0001,132,0002,113,536
4Jun 25, 2026 22:3464,56733,944,37322,679,0001,211,0002,113,536
5Jun 25, 2026 22:3464,68333,191,52822,796,0001,137,0002,113,536
6Jun 25, 2026 22:3464,74533,677,85222,726,0001,230,0002,113,536
7Jun 25, 2026 22:3464,80033,713,75022,748,0001,228,0002,113,536
8Jun 25, 2026 22:3465,00233,730,32722,828,0001,223,0002,113,536
9Jun 25, 2026 22:3465,08133,839,06222,824,0001,256,0002,113,536