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 listFeb 11, 2026 12:11Alex KentAlex KentScore: 21,352,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 12:1121,312,0597,920,886,5017,736,586,000148,876,0002,437,120
2Feb 11, 2026 12:1121,352,0977,931,006,0887,755,400,000144,876,0002,281,472
3Feb 11, 2026 12:1121,476,4327,978,309,0637,802,402,000143,878,0002,281,472