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 15, 2021 20:15piculpiculScore: 72,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:1571,38158,081,01526,411,00002,277,376
2Sep 15, 2021 20:1571,45752,664,07725,423,0001,016,0002,527,232
3Sep 15, 2021 20:1571,55953,443,39925,459,0001,018,0002,277,376
4Sep 15, 2021 20:1571,63248,414,11226,504,00002,277,376
5Sep 15, 2021 20:1571,86253,054,79625,567,0001,022,0002,281,472
6Sep 15, 2021 20:1571,95155,653,33725,599,0001,023,0002,289,664
7Sep 15, 2021 20:1572,23052,821,33625,698,0001,027,0002,273,280
8Sep 15, 2021 20:1572,54654,730,63125,848,000994,0002,392,064
9Sep 15, 2021 20:1572,57654,992,17924,864,0001,989,0002,265,088
10Sep 15, 2021 20:1573,99092,349,55627,376,46002,256,896
11Sep 15, 2021 20:1574,35890,811,59927,512,35902,273,280
12Sep 15, 2021 20:1575,00076,194,83327,749,88702,269,184