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 30, 2026 22:12IlyaIlyaScore: 59,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:1358,60031,065,80220,590,0001,092,0002,113,536
2Jun 30, 2026 22:1358,89131,211,39620,624,0001,166,0002,113,536
3Jun 30, 2026 22:1358,97231,860,03120,609,0001,211,0002,113,536
4Jun 30, 2026 22:1358,99731,341,87220,630,0001,199,0002,113,536
5Jun 30, 2026 22:1359,03231,790,44520,645,0001,197,0002,113,536
6Jun 30, 2026 22:1359,04831,815,16420,655,0001,193,0002,113,536
7Jun 30, 2026 22:1359,15631,861,48920,678,0001,210,0002,113,536
8Jun 30, 2026 22:1359,16431,364,65320,681,0001,210,0002,113,536
9Jun 30, 2026 22:1359,21831,877,90420,678,0001,233,0002,113,536