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 23:28IlyaIlyaScore: 58,862Success
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 23:3158,51631,318,08820,505,0001,146,0002,113,536
2Jul 8, 2026 23:3158,82932,066,73420,534,0001,233,0002,113,536
3Jul 8, 2026 23:3158,84332,051,63220,553,0001,219,0002,113,536
4Jul 8, 2026 23:3158,85631,993,11020,560,0001,217,0002,113,536
5Jul 8, 2026 23:3158,86232,047,40820,577,0001,202,0002,113,536
6Jul 8, 2026 23:3158,97832,099,83320,607,0001,215,0002,113,536
7Jul 8, 2026 23:3120,989,3107,776,502,7267,615,076,000150,969,0002,113,536
8Jul 8, 2026 23:3121,073,9787,807,208,7907,648,006,000149,366,0002,113,536
9Jul 8, 2026 23:3121,209,2137,857,323,2027,694,872,000152,537,0002,113,536