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 listApr 16, 2026 18:08olliecrowolliecrowScore: 550,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 18:08548,576229,753,74728,996,000173,977,0002,523,136
2Apr 16, 2026 18:08550,795228,041,43727,971,000175,823,0002,359,296
3Apr 16, 2026 18:08574,481241,762,09728,939,000183,619,0002,375,680