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, 2021 10:05Mikhail ShirokovMikhail ShirokovScore: 106,435Success
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, 2021 10:05105,06267,057,94236,880,0001,993,0002,392,064
2Sep 16, 2021 10:05105,10866,635,22336,896,0001,994,0002,387,968
3Sep 16, 2021 10:05105,66264,270,11238,093,0001,002,0002,519,040
4Sep 16, 2021 10:05105,70872,750,57137,107,0002,005,0002,387,968
5Sep 16, 2021 10:05105,72275,846,76937,111,0002,006,0002,519,040
6Sep 16, 2021 10:05106,05465,358,36637,228,0002,012,0002,519,040
7Sep 16, 2021 10:05106,43561,140,77338,372,0001,009,0002,387,968
8Sep 16, 2021 10:05106,99267,643,27138,572,0001,015,0002,519,040
9Sep 16, 2021 10:05107,02271,236,23539,598,00002,519,040
10Sep 16, 2021 10:05108,971102,167,87040,319,20202,248,704
11Sep 16, 2021 10:05109,440113,521,23940,492,93102,240,512
12Sep 16, 2021 10:05110,011108,386,16240,704,14302,252,800