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 listJun 25, 2026 17:25IlyaIlyaScore: 21,862,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 17:2721,758,4108,060,061,4757,878,745,000171,867,0002,113,536
2Jun 25, 2026 17:2721,808,8188,079,144,6427,904,174,000165,089,0002,113,536
3Jun 25, 2026 17:2721,854,1898,095,814,1467,922,414,000163,636,0002,113,536
4Jun 25, 2026 17:2721,856,9568,097,065,8517,920,073,000167,001,0002,113,536
5Jun 25, 2026 17:2721,862,5728,098,889,8987,928,704,000160,448,0002,113,536
6Jun 25, 2026 17:2721,922,1818,121,134,8817,941,653,000169,554,0002,113,536
7Jun 25, 2026 17:2721,934,7948,125,999,9837,955,502,000160,372,0002,113,536
8Jun 25, 2026 17:2721,942,7758,128,323,3227,952,748,000166,079,0002,113,536
9Jun 25, 2026 17:2721,989,1168,145,514,6657,967,462,000168,511,0002,113,536