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 23, 2024 17:56CemaCemaScore: 93,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:5691,44961,232,34232,841,000995,0002,281,472
2May 23, 2024 17:5691,60558,641,09831,901,0001,993,0002,281,472
3May 23, 2024 17:5692,37656,154,54632,169,0002,010,0002,510,848
4May 23, 2024 17:5692,89260,172,63532,349,0002,021,0002,281,472
5May 23, 2024 17:5692,90861,436,67132,354,0002,022,0002,281,472
6May 23, 2024 17:5692,97358,100,32832,377,0002,023,0002,281,472
7May 23, 2024 17:5693,15156,153,57333,453,0001,013,0002,281,472
8May 23, 2024 17:5693,81158,628,56033,690,0001,020,0002,506,752
9May 23, 2024 17:5694,29568,901,01432,896,0001,993,0002,510,848
10May 23, 2024 17:5697,515109,412,66536,080,52802,244,608
11May 23, 2024 17:5697,78396,929,77436,179,75402,228,224
12May 23, 2024 17:5698,090121,669,79836,293,31802,240,512