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 26, 2024 22:41Yuriy LyfenkoYuriy LyfenkoScore: 59,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2024 22:4159,211548,531,53619,917,0001,991,0002,269,184
2Jul 26, 2024 22:4159,222550,112,14319,920,0001,992,0002,437,120
3Jul 26, 2024 22:4159,257547,682,00719,932,0001,993,0002,531,328
4Jul 26, 2024 22:4159,327543,844,52419,956,0001,995,0002,269,184
5Jul 26, 2024 22:4159,411542,645,39619,984,0001,998,0002,531,328
6Jul 26, 2024 22:4159,459542,716,70220,000,0002,000,0002,531,328
7Jul 26, 2024 22:4159,522544,036,35120,021,0002,002,0002,531,328
8Jul 26, 2024 22:4159,649549,599,64220,064,0002,006,0002,269,184
9Jul 26, 2024 22:4159,684543,806,28920,076,0002,007,0002,269,184
10Jul 26, 2024 22:4162,438597,222,88323,102,16902,252,800
11Jul 26, 2024 22:4162,490589,917,28123,121,17002,248,704
12Jul 26, 2024 22:4162,675594,776,67823,189,78202,252,800