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 8, 2026 21:09IlyaIlyaScore: 59,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:1058,99131,451,08920,714,0001,113,0002,113,536
2Jul 8, 2026 21:1059,06731,466,01320,719,0001,136,0002,113,536
3Jul 8, 2026 21:1059,20231,519,95320,764,0001,141,0002,113,536
4Jul 8, 2026 21:1059,30833,000,76420,751,0001,193,0002,113,536
5Jul 8, 2026 21:1059,31831,608,64920,841,0001,107,0002,113,536
6Jul 8, 2026 21:1059,32732,266,18020,736,0001,215,0002,113,536
7Jul 8, 2026 21:1059,37031,635,30020,818,0001,149,0002,113,536
8Jul 8, 2026 21:1060,61342,564,42821,254,0001,173,0002,113,536
9Jul 8, 2026 21:1062,68343,307,19221,903,0001,290,0002,113,536