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 listJan 13, 2026 02:57Josu San MartinJosu San MartinScore: 537,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 02:57528,100223,155,35024,923,000170,474,0002,367,488
2Jan 13, 2026 02:57537,524220,426,77624,985,000173,899,0002,457,600
3Jan 13, 2026 02:57541,051228,404,49926,024,000174,165,0002,445,312