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 listJun 30, 2026 16:49IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 16:50034,989,24524,303,0001,109,0002,113,536expected "429496524123 ", got "429496520255 "
2Jun 30, 2026 16:5069,01035,049,46024,426,0001,108,0002,113,536
3Jun 30, 2026 16:5069,11035,085,01924,466,0001,105,0002,113,536
4Jun 30, 2026 16:5069,20235,067,27324,486,0001,119,0002,113,536
5Jun 30, 2026 16:5069,27035,119,00824,488,0001,142,0002,113,536
6Jun 30, 2026 16:5069,65635,772,81824,660,0001,113,0002,113,536
7Jun 30, 2026 16:5069,97835,933,10924,658,0001,234,0002,113,536
8Jun 30, 2026 16:5070,23735,624,94424,770,0001,218,0002,113,536
9Jun 30, 2026 16:5021,137,2837,830,487,4227,663,895,000156,900,0002,113,536