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 24, 2026 12:44Victor MerckléVictor MerckléScore: 63,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:4562,81830,810,07823,243,00002,113,536
2Jun 24, 2026 12:4562,87030,890,79223,262,00002,113,536
3Jun 24, 2026 12:4563,00530,971,12423,312,00002,113,536
4Jun 24, 2026 12:4563,13231,380,15323,359,00002,113,536
5Jun 24, 2026 12:4563,33530,997,95123,434,00002,113,536
6Jun 24, 2026 12:4563,34531,003,52223,438,00002,113,536
7Jun 24, 2026 12:4563,39730,975,77423,457,00002,113,536
8Jun 24, 2026 12:4563,41331,107,48923,463,00002,113,536
9Jun 24, 2026 12:4563,67531,180,30523,560,00002,113,536