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 7, 2026 14:14IlyaIlyaScore: 59,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:1558,84831,335,22020,654,0001,120,0002,113,536
2Jul 7, 2026 14:1558,98631,432,60220,706,0001,119,0002,113,536
3Jul 7, 2026 14:1559,10031,480,98220,754,0001,113,0002,113,536
4Jul 7, 2026 14:1559,17231,528,89520,744,0001,150,0002,113,536
5Jul 7, 2026 14:1559,21031,510,50320,700,0001,208,0002,113,536
6Jul 7, 2026 14:1559,26231,658,38720,737,0001,190,0002,113,536
7Jul 7, 2026 14:1559,36431,685,22420,879,0001,086,0002,113,536
8Jul 7, 2026 14:1559,38640,225,33920,831,0001,142,0002,117,632
9Jul 7, 2026 14:1562,17045,039,49121,718,0001,285,0002,117,632