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 15, 2025 02:01Steve BronderSteve BronderScore: 63,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 02:0162,61146,460,53521,152,0002,014,0002,433,024
2Jul 15, 2025 01:4862,65144,904,83622,174,0001,007,0002,519,040
3Jul 15, 2025 01:4862,66549,952,03822,178,0001,008,0002,428,928
4Jul 15, 2025 01:4862,67843,542,57621,175,0002,016,0002,433,024
5Jul 15, 2025 01:4862,77642,883,15522,218,0001,009,0002,535,424
6Jul 15, 2025 01:4862,87346,090,08621,241,0002,022,0002,424,832
7Jul 15, 2025 01:4863,06250,487,20622,319,0001,014,0002,523,136
8Jul 15, 2025 02:0163,09245,110,84023,344,00002,510,848
9Jul 15, 2025 01:4863,11946,383,54822,339,0001,015,0002,428,928
10Jul 15, 2025 02:0163,20042,021,42223,384,00002,539,520
11Jul 15, 2025 01:4863,34950,776,10323,439,00002,539,520
12Jul 15, 2025 01:4863,39245,585,38023,455,00002,437,120