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 8, 2026 21:31IlyaIlyaScore: 58,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 8, 2026 21:3358,42932,563,15120,497,0001,122,0002,113,536
2Jul 8, 2026 21:3358,52131,232,13320,529,0001,124,0002,113,536
3Jul 8, 2026 21:3358,55431,336,19420,557,0001,108,0002,113,536
4Jul 8, 2026 21:3358,57031,395,94120,558,0001,113,0002,113,536
5Jul 8, 2026 21:3358,68931,303,73020,585,0001,130,0002,113,536
6Jul 8, 2026 21:3358,68931,330,06920,501,0001,214,0002,113,536
7Jul 8, 2026 21:3358,71031,406,49520,508,0001,215,0002,113,536
8Jul 8, 2026 21:3358,78331,424,09820,546,0001,204,0002,113,536
9Jul 8, 2026 21:3360,17832,486,16321,022,0001,244,0002,113,536