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 13:17Yuriy LyfenkoYuriy LyfenkoScore: 112,073Success
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 13:17111,07364,279,19538,090,0003,007,0002,330,624
2Jul 13, 2021 13:17111,14365,376,67239,117,0002,006,0002,514,944
3Jul 13, 2021 13:17111,31664,116,28739,178,0002,009,0002,519,040
4Jul 13, 2021 13:17111,33864,178,14539,186,0002,009,0002,531,328
5Jul 13, 2021 13:17111,48665,264,35038,232,0003,018,0002,334,720
6Jul 13, 2021 13:17111,51461,327,98238,241,0003,019,0002,334,720
7Jul 13, 2021 13:17112,07363,340,35839,445,0002,022,0002,527,232
8Jul 13, 2021 13:17112,15467,657,07140,485,0001,012,0002,334,720
9Jul 13, 2021 13:17112,31967,088,70641,558,00002,334,720
10Jul 13, 2021 13:17113,398104,202,88441,957,14602,191,360
11Jul 13, 2021 13:17113,75197,680,37842,087,75702,179,072
12Jul 13, 2021 13:17113,978107,553,10942,171,82502,187,264