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 listMar 15, 2026 19:15Elijah KinElijah KinScore: 202,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:15201,470103,120,03434,250,00040,294,0002,273,280
2Mar 15, 2026 19:15201,568105,473,33528,219,00046,361,0002,273,280
3Mar 15, 2026 19:15202,168102,510,65836,902,00037,900,0002,322,432
4Mar 15, 2026 19:15202,20398,535,27337,906,00036,909,0002,273,280
5Mar 15, 2026 19:15202,22299,588,10728,931,00045,891,0002,273,280
6Mar 15, 2026 19:15202,222103,005,92628,931,00045,891,0002,310,144
7Mar 15, 2026 19:15202,357101,457,44331,945,00042,927,0002,322,432
8Mar 15, 2026 19:15203,611100,528,30427,121,00048,215,0002,326,528
9Mar 15, 2026 19:15205,18195,089,22329,967,00045,950,0002,330,624