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:13Steve BronderSteve BronderScore: 63,249Success
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:1362,93846,176,25422,275,0001,012,0002,539,520
2Jul 15, 2025 02:1363,24940,954,35722,385,0001,017,0002,433,024
3Jul 15, 2025 02:1363,41949,502,78423,465,00002,424,832