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 8, 2026 21:48IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:49032,197,50020,719,0001,203,0002,113,536expected "429496504775 ", got "429496727793 "
2Jul 8, 2026 21:49032,324,76320,842,0001,202,0002,113,536expected "429496517076 ", got "429496727453 "
3Jul 8, 2026 21:49031,537,21420,727,0001,110,0002,113,536expected "429496491772 ", got "429496727373 "