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 listJun 30, 2026 09:47IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 09:47031,601,77620,988,0001,102,0002,113,536expected "429496557283 ", got "429496383448 "
2Jun 30, 2026 09:4721,242,3137,869,457,3987,705,184,000154,472,0002,113,536
3Jun 30, 2026 09:4721,263,9187,877,677,6947,715,026,000152,624,0002,113,536