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 listDec 24, 2023 03:08Kenneth MaplesKenneth MaplesScore: 73,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 03:0873,13854,507,60125,057,0002,004,0002,289,664
2Dec 24, 2023 03:0873,25949,646,40125,099,0002,007,0002,289,664
3Dec 24, 2023 03:0873,36249,351,16025,134,0002,010,0002,359,296
4Dec 24, 2023 03:0873,53550,032,93525,193,0002,015,0002,502,656
5Dec 24, 2023 03:0873,64150,460,00225,229,0002,018,0002,289,664
6Dec 24, 2023 03:0873,70548,761,43625,251,0002,020,0002,347,008
7Dec 24, 2023 03:0873,71950,837,64925,256,0002,020,0002,289,664
8Dec 24, 2023 03:0873,80556,642,99125,286,0002,022,0002,281,472
9Dec 24, 2023 03:0873,94349,352,42125,333,0002,026,0002,289,664
10Dec 24, 2023 03:0876,385101,504,87628,262,49402,224,128
11Dec 24, 2023 03:0876,549100,494,48028,323,09202,224,128
12Dec 24, 2023 03:0876,73999,816,29028,393,57902,224,128