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 10:20MMisMMisScore: 1,985,730Success
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 10:201,960,359756,599,368539,504,000185,829,0002,289,664
2Feb 10, 2026 10:201,980,049758,792,173545,716,000186,902,0002,273,280
3Feb 10, 2026 10:201,981,357759,580,818546,331,000186,771,0002,277,376
4Feb 10, 2026 10:201,983,541761,327,994550,933,000182,977,0002,277,376
5Feb 10, 2026 10:201,985,730757,524,035549,791,000184,929,0002,527,232
6Feb 10, 2026 10:201,986,981764,820,562550,389,000184,794,0002,289,664
7Feb 10, 2026 10:201,988,208758,432,776549,729,000185,908,0002,277,376
8Feb 10, 2026 10:201,988,635765,195,030550,847,000184,948,0002,269,184
9Feb 10, 2026 10:202,004,789763,825,520554,830,000186,942,0002,273,280