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 listSep 16, 2024 23:02CheranMahalingamCheranMahalingamScore: 757,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 23:02756,230309,923,73178,945,000200,860,0002,465,792
2Sep 16, 2024 23:02756,551305,839,65394,974,000184,950,0002,338,816
3Sep 16, 2024 23:02756,854304,292,20580,010,000200,026,0002,310,144
4Sep 16, 2024 23:02756,911308,595,55390,018,000190,039,0002,301,952
5Sep 16, 2024 23:02757,343307,354,49780,062,000200,155,0002,408,448
6Sep 16, 2024 23:02764,624319,266,67380,974,000201,937,0002,363,392
7Sep 16, 2024 23:02772,976307,797,17483,000,000203,001,0002,306,048
8Sep 16, 2024 23:02774,989316,757,13781,927,000204,819,0002,314,240
9Sep 16, 2024 23:02778,097317,289,52879,971,000207,925,0002,347,008