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 28, 2023 20:45Franek KortaFranek KortaScore: 75,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:4575,26553,698,81026,854,000994,0002,514,944
2Aug 28, 2023 20:4575,31450,045,50726,871,000995,0002,428,928
3Aug 28, 2023 20:4575,43047,814,13926,913,000996,0002,514,944
4Aug 28, 2023 20:4575,62752,791,42526,983,000999,0002,519,040
5Aug 28, 2023 20:4575,75750,824,38825,027,0003,003,0002,424,832
6Aug 28, 2023 20:4575,84147,763,49026,057,0002,004,0002,514,944
7Aug 28, 2023 20:4575,97054,189,86826,102,0002,007,0002,433,024
8Aug 28, 2023 20:4576,08455,268,97127,146,0001,005,0002,424,832
9Aug 28, 2023 20:4576,18951,085,99827,184,0001,006,0002,420,736
10Aug 28, 2023 20:4579,222109,647,59629,312,01102,277,376
11Aug 28, 2023 20:4579,596101,167,98129,450,37202,269,184
12Aug 28, 2023 20:4579,898132,876,04329,562,15502,269,184