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:47IlyaIlyaError
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:49031,423,40420,458,0001,239,0002,113,536expected "429496638061 ", got "429496486501 "
2Jul 7, 2026 12:4921,424,8327,937,440,1867,779,102,000148,086,0002,113,536
3Jul 7, 2026 12:4921,551,9677,984,049,1397,819,570,000154,658,0002,113,536
4Jul 7, 2026 12:4921,590,3757,998,689,7087,838,443,000149,996,0002,113,536
5Jul 7, 2026 12:4921,619,8218,010,670,0557,846,279,000153,055,0002,113,536
6Jul 7, 2026 12:4921,667,9138,027,515,6017,858,578,000158,550,0002,134,016
7Jul 7, 2026 12:4921,705,1628,041,357,6657,878,066,000152,844,0002,113,536
8Jul 7, 2026 12:4921,731,6518,050,559,0207,891,941,000148,770,0002,113,536
9Jul 7, 2026 12:4921,844,9218,093,093,3637,928,937,000153,684,0002,113,536