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 21, 2026 06:44Elijah KinElijah KinScore: 66,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 06:4566,70033,678,43423,565,0001,114,0002,113,536
2Jun 21, 2026 06:4566,70533,690,34923,568,0001,113,0002,113,536
3Jun 21, 2026 06:4566,74533,691,15923,582,0001,114,0002,113,536
4Jun 21, 2026 06:4566,93733,871,51523,645,0001,122,0002,113,536
5Jun 21, 2026 06:4566,96234,108,45923,652,0001,124,0002,113,536
6Jun 21, 2026 06:4567,15933,957,58023,813,0001,036,0002,113,536
7Jun 21, 2026 06:4567,18934,486,91823,755,0001,105,0002,113,536
8Jun 21, 2026 06:4567,22933,876,16623,764,0001,111,0002,113,536
9Jun 21, 2026 06:4567,44833,981,52023,918,0001,038,0002,113,536