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 listJul 13, 2021 18:55Yuriy LyfenkoYuriy LyfenkoScore: 62,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:5561,735544,869,02820,856,0001,986,0002,527,232
2Jul 13, 2021 18:5561,903546,262,46920,913,0001,991,0002,404,352
3Jul 13, 2021 18:5561,930547,780,83320,922,0001,992,0002,285,568
4Jul 13, 2021 18:5562,041547,773,61720,959,0001,996,0002,523,136
5Jul 13, 2021 18:5562,059545,779,94820,966,0001,996,0002,281,472
6Jul 13, 2021 18:5562,073548,289,18921,969,000998,0002,285,568
7Jul 13, 2021 18:5562,119549,008,22620,986,0001,998,0002,285,568
8Jul 13, 2021 18:5562,132550,686,75820,990,0001,999,0002,269,184
9Jul 13, 2021 18:5562,238546,604,71421,026,0002,002,0002,281,472
10Jul 13, 2021 18:5564,646578,337,20323,918,89102,244,608
11Jul 13, 2021 18:5564,686583,431,65623,933,77502,265,088
12Jul 13, 2021 18:5564,803590,368,95423,977,01302,256,896