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 30, 2026 13:42IlyaIlyaScore: 59,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 13:4359,01331,350,28520,722,0001,113,0002,113,536
2Jun 30, 2026 13:4359,16731,438,48220,755,0001,137,0002,113,536
3Jun 30, 2026 13:4359,18931,427,59320,786,0001,114,0002,113,536
4Jun 30, 2026 13:4359,33231,498,73820,766,0001,187,0002,113,536
5Jun 30, 2026 13:4359,39131,452,61120,848,0001,127,0002,113,536
6Jun 30, 2026 13:4359,47231,580,93920,790,0001,215,0002,113,536
7Jun 30, 2026 13:4359,49731,977,24820,767,0001,247,0002,113,536
8Jun 30, 2026 13:4359,50031,584,43620,819,0001,196,0002,113,536
9Jun 30, 2026 13:4359,71333,354,98020,986,0001,108,0002,113,536