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 12, 2026 19:06IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 19:07031,228,01720,454,0001,133,0002,113,536expected "429496454875 ", got "429496729300 "
2Jul 12, 2026 19:07031,249,11220,492,0001,119,0002,113,536expected "429496536463 ", got "429496729300 "
3Jul 12, 2026 19:07031,295,68120,435,0001,106,0002,113,536expected "429496553469 ", got "429496729300 "