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 8, 2026 01:01Victor MerckléVictor MerckléScore: 66,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:0265,99433,530,99823,345,0001,073,0002,113,536
2Jun 8, 2026 01:0266,06433,495,28523,365,0001,079,0002,113,536
3Jun 8, 2026 01:0266,10033,543,54723,410,0001,047,0002,113,536
4Jun 8, 2026 01:0266,14034,822,92623,335,0001,137,0002,113,536
5Jun 8, 2026 01:0266,15433,592,56423,394,0001,083,0002,113,536
6Jun 8, 2026 01:0266,34033,595,20323,397,0001,149,0002,113,536
7Jun 8, 2026 01:0266,50533,672,46823,529,0001,078,0002,113,536
8Jun 8, 2026 01:0266,61333,727,94523,559,0001,088,0002,113,536
9Jun 8, 2026 01:0266,74533,797,47723,525,0001,171,0002,113,536