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:13Yuriy LyfenkoYuriy LyfenkoScore: 64,551Success
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:1364,208548,508,33422,768,000989,0002,273,280
2Jul 13, 2021 18:1364,224551,563,70321,783,0001,980,0002,281,472
3Jul 13, 2021 18:1364,235549,571,39522,777,000990,0002,281,472
4Jul 13, 2021 18:1364,468551,954,55421,866,0001,987,0002,289,664
5Jul 13, 2021 18:1364,486548,015,79221,872,0001,988,0002,281,472
6Jul 13, 2021 18:1364,543554,278,50121,891,0001,990,0002,285,568
7Jul 13, 2021 18:1364,551551,104,50521,894,0001,990,0002,281,472
8Jul 13, 2021 18:1364,614553,221,46921,915,0001,992,0002,273,280
9Jul 13, 2021 18:1364,705552,633,59921,946,0001,995,0002,285,568
10Jul 13, 2021 18:1367,312581,775,10624,905,29402,252,800
11Jul 13, 2021 18:1367,402591,478,87624,938,65602,256,896
12Jul 13, 2021 18:1367,615586,337,88825,017,66102,248,704