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 listJul 2, 2026 21:26Victor MerckléVictor MerckléScore: 56,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 21:2756,65428,665,91420,962,00002,113,536
2Jul 2, 2026 21:2756,74528,692,13220,996,00002,113,536
3Jul 2, 2026 21:2756,79428,763,61419,991,0001,023,0002,113,536
4Jul 2, 2026 21:2756,81328,740,83921,021,00002,113,536
5Jul 2, 2026 21:2756,92128,822,83021,061,00002,113,536
6Jul 2, 2026 21:2756,93228,792,61820,030,0001,035,0002,113,536
7Jul 2, 2026 21:2756,96229,716,54820,071,0001,005,0002,113,536
8Jul 2, 2026 21:2756,97028,842,44420,058,0001,021,0002,113,536
9Jul 2, 2026 21:2758,77536,535,90220,722,0001,025,0002,113,536