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 13:01IlyaIlyaError
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 13:04031,450,40920,792,0001,175,0002,113,536expected "429496526725 ", got "429496528808 "
2Jul 3, 2026 13:0459,03231,270,65320,655,0001,187,0002,113,536
3Jul 3, 2026 13:0459,36431,930,29620,741,0001,224,0002,113,536