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 listAug 12, 2025 20:40JensJensScore: 21,547,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 20:4021,288,1707,903,320,4677,674,787,000201,836,0002,277,376
2Aug 12, 2025 20:4021,348,2787,930,855,1267,708,036,000190,827,0002,277,376
3Aug 12, 2025 20:4021,455,0437,975,318,9127,750,523,000187,843,0002,277,376
4Aug 12, 2025 20:4021,472,1547,973,528,6767,757,846,000186,851,0002,277,376
5Aug 12, 2025 20:4021,547,7928,001,841,7577,781,835,000190,848,0002,277,376
6Aug 12, 2025 20:4021,549,8498,009,241,1007,790,618,000182,826,0002,277,376
7Aug 12, 2025 20:4021,553,7768,016,686,1357,787,041,000187,856,0002,310,144
8Aug 12, 2025 20:4021,618,5468,034,046,9247,800,040,000198,822,0002,363,392
9Aug 12, 2025 20:4021,628,8168,036,251,3747,803,820,000198,842,0002,277,376