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:40Yuriy LyfenkoYuriy LyfenkoScore: 59,689Success
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:4059,465546,817,35620,002,0002,000,0002,535,424
2Jul 26, 2024 22:4059,468544,777,64320,003,0002,000,0002,269,184
3Jul 26, 2024 22:4059,568545,383,93720,037,0002,003,0002,269,184
4Jul 26, 2024 22:4059,624546,163,75120,056,0002,005,0002,269,184
5Jul 26, 2024 22:4059,678544,316,28020,074,0002,007,0002,269,184
6Jul 26, 2024 22:4059,681546,221,13620,075,0002,007,0002,269,184
7Jul 26, 2024 22:4059,689544,201,13620,078,0002,007,0002,531,328
8Jul 26, 2024 22:4059,778545,177,73020,108,0002,010,0002,428,928
9Jul 26, 2024 22:4059,919543,543,07421,163,0001,007,0002,269,184
10Jul 26, 2024 22:4062,316584,410,28123,057,01902,174,976
11Jul 26, 2024 22:4062,486590,842,28823,119,99302,248,704
12Jul 26, 2024 22:4062,646587,587,97823,179,11002,248,704