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 3, 2026 08:16IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:17033,276,72622,692,0001,127,0002,113,536expected "429496543785 ", got "429496601953 "
2Jul 3, 2026 08:17033,253,39022,648,0001,097,0002,113,536expected "429496504795 ", got "429496569900 "
3Jul 3, 2026 08:17033,443,63222,718,0001,190,0002,113,536expected "429496513037 ", got "429496598155 "