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 listNov 1, 2021 10:48Ilya AniskovetsIlya AniskovetsScore: 119,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 10:48118,67366,373,92841,914,0001,995,0002,289,664
2Nov 1, 2021 10:48118,68965,371,42641,919,0001,996,0002,273,280
3Nov 1, 2021 10:48118,82269,646,52641,966,0001,998,0002,289,664
4Nov 1, 2021 10:48118,97070,320,57642,019,0002,000,0002,289,664
5Nov 1, 2021 10:48119,05966,059,91942,050,0002,002,0002,289,664
6Nov 1, 2021 10:48119,06265,309,25842,051,0002,002,0002,289,664
7Nov 1, 2021 10:48119,12765,966,03743,076,0001,001,0002,527,232
8Nov 1, 2021 10:48119,24369,711,16742,115,0002,005,0002,289,664
9Nov 1, 2021 10:48119,30372,173,75942,136,0002,006,0002,527,232
10Nov 1, 2021 10:48121,605104,815,55044,993,99802,281,472
11Nov 1, 2021 10:48122,446113,811,32445,304,83802,269,184
12Nov 1, 2021 10:48122,678124,620,67145,390,72102,277,376