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 12, 2026 06:58Victor MerckléVictor MerckléScore: 63,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:5962,90230,780,85123,274,00002,113,536
2Jun 12, 2026 06:5962,92130,905,00723,281,00002,113,536
3Jun 12, 2026 06:5963,24831,112,66823,402,00002,113,536
4Jun 12, 2026 06:5963,33731,067,57422,420,0001,015,0002,113,536
5Jun 12, 2026 06:5963,48331,017,09023,489,00002,113,536
6Jun 12, 2026 06:5963,50031,006,48823,495,00002,113,536
7Jun 12, 2026 06:5963,61831,018,06323,539,00002,113,536
8Jun 12, 2026 06:5963,72931,261,95223,580,00002,113,536
9Jun 12, 2026 06:5963,89431,230,59523,641,00002,113,536