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 10, 2026 14:10MMisMMisScore: 587,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 14:10581,959240,914,21534,890,000180,435,0002,375,680
2Feb 10, 2026 14:10582,103242,792,16236,063,000179,315,0002,433,024
3Feb 10, 2026 14:10583,605242,069,15034,989,000180,945,0002,527,232
4Feb 10, 2026 14:10585,932240,749,76934,967,000181,828,0002,277,376
5Feb 10, 2026 14:10587,143244,561,52936,040,000181,203,0002,281,472
6Feb 10, 2026 14:10592,886248,938,62634,899,000184,469,0002,478,080
7Feb 10, 2026 14:10593,014245,693,05235,904,000183,511,0002,347,008
8Feb 10, 2026 14:10595,451248,740,71837,053,000183,264,0002,273,280
9Feb 10, 2026 14:10597,041245,808,64534,985,000185,920,0002,445,312