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 listApr 22, 2026 22:45Charles CabergsCharles CabergsScore: 70,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 22:4670,65449,172,43925,137,0001,005,0002,355,200
2Apr 22, 2026 22:4670,79744,639,62325,188,0001,007,0002,359,296
3Apr 22, 2026 22:4670,80844,592,27324,184,0002,015,0002,310,144
4Apr 22, 2026 22:4670,90240,724,30524,216,0002,018,0002,363,392
5Apr 22, 2026 22:4670,93744,703,10425,238,0001,009,0002,363,392
6Apr 22, 2026 22:4670,98147,336,55425,253,0001,010,0002,363,392
7Apr 22, 2026 22:4671,10842,907,59425,299,0001,011,0002,355,200
8Apr 22, 2026 22:4671,16241,647,63425,318,0001,012,0002,306,048
9Apr 22, 2026 22:4671,22745,200,51725,341,0001,013,0002,359,296