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 16, 2026 06:42Fernando AntunezFernando AntunezError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 06:42050,713,13240,139,0001,025,0002,113,536expected "429496536731 ", got "0 "
2Jul 16, 2026 06:42050,593,20839,810,0001,228,0002,113,536expected "429496473234 ", got "0 "
3Jul 16, 2026 06:42051,284,24140,594,0001,031,0002,113,536expected "429496507272 ", got "0 "