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 26, 2026 16:17Misgana BayettaMisgana BayettaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 16:18013,979,336,81213,729,186,000230,268,0002,113,536expected "429496530790 ", got "0 "
2Jul 26, 2026 16:18010,753,138,02610,500,859,000233,772,0002,125,824expected "429496505464 ", got "0 "
3Jul 26, 2026 16:18014,922,060,54014,681,545,000222,926,0002,142,208expected "429496510204 ", got "0 "