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 listOct 20, 2026 07:36e1011e1011Score: 85,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:4084,00542,513,61729,885,0001,197,0002,113,536
2Oct 20, 2026 07:4084,12142,759,92629,939,0001,186,0002,113,536
3Oct 20, 2026 07:4084,16442,134,04630,034,0001,107,0002,113,536
4Oct 20, 2026 07:4084,71042,306,04430,159,0001,184,0002,113,536
5Oct 20, 2026 07:4085,07842,644,83330,456,0001,023,0002,113,536
6Oct 20, 2026 07:4085,34342,540,41630,375,0001,202,0002,113,536
7Oct 20, 2026 07:4087,83267,168,11831,445,0001,053,0002,117,632
8Oct 20, 2026 07:4096,03746,925,64434,516,0001,018,0002,113,536
9Oct 20, 2026 07:4096,16247,031,08934,375,0001,205,0002,113,536