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 24, 2024 18:10DanielDanielScore: 92,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 18:1091,57359,956,43832,856,0001,026,0002,375,680
2Jul 24, 2024 18:1091,94357,571,87432,018,0002,001,0002,375,680
3Jul 24, 2024 18:1092,02458,650,12532,047,0002,002,0002,289,664
4Jul 24, 2024 18:1092,09264,961,10734,074,00002,281,472
5Jul 24, 2024 18:1092,10857,444,85332,076,0002,004,0002,367,488
6Jul 24, 2024 18:1092,31158,936,26032,146,0002,009,0002,289,664
7Jul 24, 2024 18:1092,76860,499,73533,315,0001,009,0002,375,680
8Jul 24, 2024 18:1092,84960,390,14032,334,0002,020,0002,289,664
9Jul 24, 2024 18:1092,85461,008,48334,356,00002,367,488
10Jul 24, 2024 18:1095,732100,032,63135,420,97502,203,648
11Jul 24, 2024 18:1095,872104,112,40135,472,81802,252,800
12Jul 24, 2024 18:1096,428100,826,44535,678,22002,220,032