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 21, 2021 18:18Yuriy LyfenkoYuriy LyfenkoScore: 61,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2021 18:1861,554548,413,64821,785,000990,0002,281,472
2Aug 21, 2021 18:1861,576548,643,57020,802,0001,981,0002,289,664
3Aug 21, 2021 18:1861,589552,355,74320,807,0001,981,0002,273,280
4Aug 21, 2021 18:1861,716547,121,29920,850,0001,985,0002,281,472
5Aug 21, 2021 18:1861,781543,763,21020,781,0002,078,0002,285,568
6Aug 21, 2021 18:1861,808544,391,62521,875,000994,0002,289,664
7Aug 21, 2021 18:1861,822543,498,70520,885,0001,989,0002,289,664
8Aug 21, 2021 18:1861,905545,639,80820,914,0001,991,0002,281,472
9Aug 21, 2021 18:1861,984550,765,42020,940,0001,994,0002,281,472
10Aug 21, 2021 18:1864,198587,545,95023,753,15502,273,280
11Aug 21, 2021 18:1864,422585,221,58223,836,19602,252,800
12Aug 21, 2021 18:1864,674594,684,63223,929,29702,248,704