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 12:12IlyaIlyaError
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 12:14031,714,07620,260,0001,238,0002,113,536expected "429496521332 ", got "429496394608 "
2Jul 7, 2026 12:14031,035,96020,274,0001,184,0002,113,536expected "429496565685 ", got "429496408219 "
3Jul 7, 2026 12:14031,050,18220,268,0001,128,0002,113,536expected "429496508555 ", got "429496324900 "
4Jul 7, 2026 12:1421,410,5457,932,284,0127,772,559,000149,343,0002,113,536
5Jul 7, 2026 12:1421,472,8297,955,132,7407,794,478,000150,469,0002,113,536
6Jul 7, 2026 12:1421,495,8837,963,265,1687,800,790,000152,687,0002,113,536
7Jul 7, 2026 12:1421,532,6137,977,135,4347,818,580,000148,487,0002,113,536
8Jul 7, 2026 12:1421,547,4057,982,425,4697,824,428,000148,112,0002,113,536
9Jul 7, 2026 12:1421,597,2298,000,804,5347,841,654,000149,321,0002,113,536