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 11, 2025 00:59Chandrasekaran AkashChandrasekaran AkashScore: 7,896,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 00:597,828,1812,921,276,9722,895,428,000999,0002,269,184
2Apr 11, 2025 00:597,896,2702,945,477,3542,920,621,000999,0002,269,184
3Apr 11, 2025 00:597,992,8162,993,794,3442,955,344,0001,998,0002,269,184