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 listJan 12, 2026 13:39Yehor BondarYehor BondarScore: 2,085,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 13:391,230,173483,045,377280,101,000175,063,0002,412,544
2Jan 12, 2026 13:392,085,300802,694,242596,661,000174,900,0002,355,200
3Jan 12, 2026 13:392,163,016827,417,355619,471,000180,845,0002,445,312