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 listOct 12, 2025 20:16Martin StensgårdMartin StensgårdScore: 21,434,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 20:1621,338,7577,927,695,7847,696,533,000198,807,0002,277,376
2Oct 12, 2025 20:1621,398,3597,950,879,9257,725,529,000191,864,0002,277,376
3Oct 12, 2025 20:1621,399,3417,948,047,0117,732,926,000184,830,0002,310,144
4Oct 12, 2025 20:1621,417,7517,958,041,7607,722,732,000201,836,0002,408,448
5Oct 12, 2025 20:1621,434,8787,964,996,5727,722,092,000208,813,0002,277,376
6Oct 12, 2025 20:1621,512,7437,995,354,0477,761,897,000197,818,0002,277,376
7Oct 12, 2025 20:1621,522,0147,992,003,3427,771,311,000191,834,0002,277,376
8Oct 12, 2025 20:1621,525,5277,997,927,9107,768,631,000195,814,0002,277,376
9Oct 12, 2025 20:1621,549,7468,009,940,5927,780,566,000192,840,0002,277,376