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 listApr 21, 2026 16:37olliecrowolliecrowScore: 62,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 16:3762,28139,995,47320,039,0003,005,0002,506,752
2Apr 21, 2026 16:3762,47842,298,12620,102,0003,015,0002,506,752
3Apr 21, 2026 16:3762,52738,352,67420,118,0003,017,0002,510,848
4Apr 21, 2026 16:3762,55440,315,45721,133,0002,012,0002,510,848
5Apr 21, 2026 16:3762,61642,019,55721,154,0002,014,0002,514,944
6Apr 21, 2026 16:3762,62740,281,33320,150,0003,022,0002,514,944
7Apr 21, 2026 16:3762,65940,839,09620,160,0003,024,0002,506,752
8Apr 21, 2026 16:3762,70245,528,66120,174,0003,026,0002,342,912
9Apr 21, 2026 16:3762,85443,368,24420,223,0003,033,0002,510,848