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:15IlyaIlyaScore: 60,659Success
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:1860,33231,799,41721,148,0001,175,0002,113,536
2Jun 29, 2026 21:1860,36431,869,36021,234,0001,101,0002,113,536
3Jun 29, 2026 21:1860,55931,847,65321,206,0001,201,0002,113,536
4Jun 29, 2026 21:1860,63732,336,53221,240,0001,196,0002,113,536
5Jun 29, 2026 21:1860,65932,398,84521,237,0001,207,0002,113,536
6Jun 29, 2026 21:1860,67832,453,97621,236,0001,215,0002,113,536
7Jun 29, 2026 21:1860,73532,439,35321,281,0001,191,0002,113,536
8Jun 29, 2026 21:1860,79432,475,78821,289,0001,205,0002,113,536
9Jun 29, 2026 21:1862,54542,623,31721,887,0001,255,0002,113,536