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 12:39IlyaIlyaScore: 59,124Success
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 12:4258,87231,259,33620,690,0001,093,0002,113,536
2Jul 2, 2026 12:4258,88631,335,43220,619,0001,169,0002,113,536
3Jul 2, 2026 12:4258,98931,761,73120,628,0001,198,0002,113,536
4Jul 2, 2026 12:4259,10231,832,93920,738,0001,130,0002,113,536
5Jul 2, 2026 12:4259,12431,832,06920,663,0001,213,0002,113,536
6Jul 2, 2026 12:4259,17531,850,03120,695,0001,200,0002,113,536
7Jul 2, 2026 12:4259,27831,865,51620,729,0001,204,0002,113,536
8Jul 2, 2026 12:4259,35632,008,68020,732,0001,230,0002,113,536
9Jul 2, 2026 12:4259,37031,909,78920,746,0001,221,0002,113,536