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 14, 2021 14:58Yuriy LyfenkoYuriy LyfenkoScore: 61,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:5861,565554,046,57820,799,0001,980,0002,527,232
2Jul 14, 2021 14:5861,595553,635,97820,809,0001,981,0002,281,472
3Jul 14, 2021 14:5861,627550,752,16621,811,000991,0002,273,280
4Jul 14, 2021 14:5861,641546,846,64521,771,0001,036,0002,281,472
5Jul 14, 2021 14:5861,773548,234,86520,869,0001,987,0002,281,472
6Jul 14, 2021 14:5861,830544,383,06920,888,0001,989,0002,535,424
7Jul 14, 2021 14:5861,895545,901,00521,906,000995,0002,285,568
8Jul 14, 2021 14:5861,965550,294,50920,934,0001,993,0002,281,472
9Jul 14, 2021 14:5862,114548,906,10820,984,0001,998,0002,281,472
10Jul 14, 2021 14:5864,374583,951,82023,818,39302,256,896
11Jul 14, 2021 14:5864,613590,952,81623,906,68802,244,608
12Jul 14, 2021 14:5864,619585,015,26723,909,16702,244,608