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 29, 2026 20:39IlyaIlyaScore: 60,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:4160,05931,689,03521,118,0001,104,0002,113,536
2Jun 29, 2026 20:4160,18631,795,40021,149,0001,120,0002,113,536
3Jun 29, 2026 20:4160,23731,701,57821,189,0001,099,0002,113,536
4Jun 29, 2026 20:4160,28631,738,26321,185,0001,121,0002,113,536
5Jun 29, 2026 20:4160,41831,754,88521,220,0001,135,0002,113,536
6Jun 29, 2026 20:4160,47031,832,77921,165,0001,209,0002,113,536
7Jun 29, 2026 20:4160,50032,045,17721,191,0001,194,0002,113,536
8Jun 29, 2026 20:4160,56231,897,89021,244,0001,164,0002,113,536
9Jun 29, 2026 20:4160,83733,266,33121,315,0001,195,0002,113,536