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:43Yuriy LyfenkoYuriy LyfenkoScore: 61,581Success
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:4361,065546,921,49321,567,0001,027,0002,437,120
2Jul 26, 2024 22:4361,500558,608,87021,766,000989,0002,269,184
3Jul 26, 2024 22:4361,508547,747,96421,769,000989,0002,531,328
4Jul 26, 2024 22:4361,551547,520,75020,794,0001,980,0002,535,424
5Jul 26, 2024 22:4361,554550,424,91020,795,0001,980,0002,531,328
6Jul 26, 2024 22:4361,559555,324,01220,797,0001,980,0002,269,184
7Jul 26, 2024 22:4361,581545,192,79620,804,0001,981,0002,531,328
8Jul 26, 2024 22:4361,686549,448,44520,840,0001,984,0002,531,328
9Jul 26, 2024 22:4361,714544,154,14920,849,0001,985,0002,535,424
10Jul 26, 2024 22:4362,453586,437,22923,107,62002,252,800
11Jul 26, 2024 22:4362,542595,613,76723,140,55202,174,976
12Jul 26, 2024 22:4362,797583,284,86823,234,87302,248,704