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 listAug 14, 2022 19:45Franek KortaFranek KortaScore: 75,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 19:4575,27351,598,36826,857,000994,0002,306,048
2Aug 14, 2022 19:4575,27652,753,85527,852,00002,322,432
3Aug 14, 2022 19:4575,34655,645,29627,878,00002,293,760
4Aug 14, 2022 19:4575,41154,888,88124,913,0002,989,0002,469,888
5Aug 14, 2022 19:4575,42752,976,10925,915,0001,993,0002,318,336
6Aug 14, 2022 19:4575,85147,138,56927,063,0001,002,0002,461,696
7Aug 14, 2022 19:4575,90352,411,94827,081,0001,003,0002,347,008
8Aug 14, 2022 19:4576,02460,476,97127,125,0001,004,0002,465,792
9Aug 14, 2022 19:4576,63849,193,13727,344,0001,012,0002,445,312
10Aug 14, 2022 19:4579,11289,427,52329,271,26302,191,360
11Aug 14, 2022 19:4579,34797,324,46029,358,37202,195,456
12Aug 14, 2022 19:4579,86394,174,54029,549,48702,195,456