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 listJun 25, 2026 18:17IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:18037,728,65727,352,0001,141,0002,113,536expected "429496516933 ", got "4294754629 "
2Jun 25, 2026 18:18038,215,30027,276,0001,212,0002,113,536expected "429496506467 ", got "4294744163 "
3Jun 25, 2026 18:18035,203,22124,855,0001,116,0002,113,536expected "429496502944 ", got "4294740640 "