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:22Mikhail ShirokovMikhail ShirokovScore: 106,438Success
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:22105,41467,068,84138,003,0001,000,0002,387,968
2Sep 16, 2021 10:22105,58467,166,87337,063,0002,003,0002,392,064
3Sep 16, 2021 10:22105,65768,500,73038,091,0001,002,0002,523,136
4Sep 16, 2021 10:22105,86572,742,38938,166,0001,004,0002,519,040
5Sep 16, 2021 10:22106,04668,607,99538,231,0001,006,0002,519,040
6Sep 16, 2021 10:22106,09264,029,20737,241,0002,013,0002,519,040
7Sep 16, 2021 10:22106,43862,934,12638,373,0001,009,0002,387,968
8Sep 16, 2021 10:22106,61661,630,04939,448,00002,523,136
9Sep 16, 2021 10:22107,73268,748,08138,865,000996,0002,383,872
10Sep 16, 2021 10:22108,665117,082,58740,206,09002,199,552
11Sep 16, 2021 10:22109,575105,009,12140,542,93102,203,648
12Sep 16, 2021 10:22110,653122,332,30740,941,74602,265,088