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 listMay 22, 2024 20:03CemaCemaScore: 94,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 20:0393,04162,769,13932,400,0002,025,0002,269,184
2May 22, 2024 20:0393,29559,742,82034,519,00002,281,472
3May 22, 2024 20:0393,73565,018,56334,682,00002,510,848
4May 22, 2024 20:0394,10055,494,07231,833,0002,984,0002,281,472
5May 22, 2024 20:0394,15461,482,92533,842,000995,0002,498,560
6May 22, 2024 20:0394,19261,140,92932,860,0001,991,0002,347,008
7May 22, 2024 20:0394,20061,615,74731,867,0002,987,0002,281,472
8May 22, 2024 20:0394,23062,277,78032,873,0001,992,0002,281,472
9May 22, 2024 20:0394,35757,968,04332,917,0001,995,0002,281,472
10May 22, 2024 20:0399,524101,563,95936,823,79302,236,416
11May 22, 2024 20:0399,67999,867,30036,881,15202,232,320
12May 22, 2024 20:03100,490105,190,57537,181,44602,232,320