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:15Kenneth MaplesKenneth MaplesScore: 75,265Success
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:1574,59755,771,68526,579,0001,022,0002,510,848
2Dec 24, 2023 03:1574,70359,758,28826,617,0001,023,0002,506,752
3Dec 24, 2023 03:1574,75153,946,76626,634,0001,024,0002,285,568
4Dec 24, 2023 03:1574,81459,750,52026,656,0001,025,0002,285,568
5Dec 24, 2023 03:1575,21155,028,32125,841,0001,987,0002,285,568
6Dec 24, 2023 03:1575,23054,103,40125,847,0001,988,0002,494,464
7Dec 24, 2023 03:1575,26554,421,65525,859,0001,989,0002,285,568
8Dec 24, 2023 03:1575,27855,970,62526,859,000994,0002,498,560
9Dec 24, 2023 03:1575,31655,943,39626,872,000995,0002,494,464
10Dec 24, 2023 03:1577,16990,576,05228,552,46502,203,648
11Dec 24, 2023 03:1577,35398,611,64528,620,57702,220,032
12Dec 24, 2023 03:1577,94294,820,26628,838,59002,228,224