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 listAug 29, 2023 21:19Franek KortaFranek KortaScore: 63,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:1963,11451,067,75021,322,0002,030,0002,441,216
2Aug 29, 2023 21:1963,13844,150,77023,361,00002,445,312
3Aug 29, 2023 21:1963,13850,136,70123,361,00002,449,408
4Aug 29, 2023 21:1963,17851,815,52723,376,00002,531,328
5Aug 29, 2023 21:1963,18449,632,74323,378,00002,449,408
6Aug 29, 2023 21:1963,23849,157,36723,398,00002,437,120
7Aug 29, 2023 21:1963,31443,417,20522,408,0001,018,0002,445,312
8Aug 29, 2023 21:1963,37645,548,12623,449,00002,441,216
9Aug 29, 2023 21:1963,44345,236,00123,474,00002,531,328
10Aug 29, 2023 21:1967,540106,673,61324,989,91002,301,952
11Aug 29, 2023 21:1967,574106,268,42225,002,48402,301,952
12Aug 29, 2023 21:1967,75288,553,96425,068,21502,301,952