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 29, 2021 16:13piculpiculScore: 73,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 16:1372,79557,398,06624,939,0001,995,0002,265,088
2Sep 29, 2021 16:1373,01659,719,93925,015,0002,001,0002,273,280
3Sep 29, 2021 16:1373,17851,215,75125,071,0002,005,0002,531,328
4Sep 29, 2021 16:1373,20847,528,66325,081,0002,006,0002,289,664
5Sep 29, 2021 16:1373,32750,378,41525,122,0002,009,0002,277,376
6Sep 29, 2021 16:1373,37650,742,49326,144,0001,005,0002,289,664
7Sep 29, 2021 16:1373,81654,225,86025,289,0002,023,0002,289,664
8Sep 29, 2021 16:1373,82751,083,95725,293,0002,023,0002,289,664
9Sep 29, 2021 16:1374,01650,589,76325,358,0002,028,0002,289,664
10Sep 29, 2021 16:1374,958107,774,86827,734,60602,269,184
11Sep 29, 2021 16:1375,54299,005,08527,950,49302,265,088
12Sep 29, 2021 16:1375,59275,613,22727,968,86302,265,088