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:07Elijah KinElijah KinScore: 147,362Success
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:08145,41663,069,36612,161,00041,643,0002,113,536
2Jun 21, 2026 06:08146,60563,917,63612,259,00041,985,0002,113,536
3Jun 21, 2026 06:08146,85963,853,13412,283,00042,055,0002,113,536
4Jun 21, 2026 06:08146,89164,052,29612,287,00042,063,0002,113,536
5Jun 21, 2026 06:08147,36264,207,92212,318,00042,206,0002,113,536
6Jun 21, 2026 06:08147,47864,271,72812,331,00042,236,0002,113,536
7Jun 21, 2026 06:08147,55663,820,62812,340,00042,256,0002,113,536
8Jun 21, 2026 06:08148,09164,480,70712,131,00042,663,0002,113,536
9Jun 21, 2026 06:08150,36464,930,83712,340,00043,295,0002,113,536