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 17:42Yehor BondarYehor BondarScore: 1,044,849Success
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 17:421,044,273410,526,131384,385,0001,996,0002,281,472
2Jan 12, 2026 17:421,044,849418,206,127385,596,000998,0002,289,664
3Jan 12, 2026 17:421,057,262415,832,659390,187,0001,000,0002,523,136