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 07:49IlyaIlyaScore: 59,429Success
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 07:5159,01631,373,48520,680,0001,156,0002,113,536
2Jun 30, 2026 07:5159,04531,318,05520,727,0001,120,0002,113,536
3Jun 30, 2026 07:5159,22731,450,42120,723,0001,191,0002,113,536
4Jun 30, 2026 07:5159,22931,883,73520,714,0001,201,0002,113,536
5Jun 30, 2026 07:5159,42931,975,47620,787,0001,202,0002,113,536
6Jun 30, 2026 07:5159,48131,952,13220,794,0001,214,0002,113,536
7Jun 30, 2026 07:5159,53532,002,62720,779,0001,249,0002,113,536
8Jun 30, 2026 07:5159,54331,963,56420,813,0001,218,0002,113,536
9Jun 30, 2026 07:5159,55931,605,53320,958,0001,079,0002,113,536