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 10:41IlyaIlyaScore: 61,327Success
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 10:4261,22932,169,45621,546,0001,109,0002,113,536
2Jun 30, 2026 10:4261,24032,161,66321,465,0001,194,0002,113,536
3Jun 30, 2026 10:4261,26732,205,74921,474,0001,195,0002,113,536
4Jun 30, 2026 10:4261,31632,195,80421,529,0001,158,0002,113,536
5Jun 30, 2026 10:4261,32732,600,34321,494,0001,197,0002,113,536
6Jun 30, 2026 10:4261,57832,763,63921,592,0001,192,0002,113,536
7Jun 30, 2026 10:4261,58132,655,08321,595,0001,190,0002,113,536
8Jun 30, 2026 10:4261,61032,798,38121,573,0001,223,0002,113,536
9Jun 30, 2026 10:4262,38141,410,18021,927,0001,154,0002,113,536