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 29, 2026 21:28IlyaIlyaScore: 59,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:3058,80031,152,52120,669,0001,087,0002,113,536
2Jun 29, 2026 21:3058,86431,278,36020,675,0001,105,0002,113,536
3Jun 29, 2026 21:3058,87531,215,81420,665,0001,119,0002,113,536
4Jun 29, 2026 21:3058,91031,346,56720,606,0001,191,0002,113,536
5Jun 29, 2026 21:3059,04531,258,43620,671,0001,176,0002,113,536
6Jun 29, 2026 21:3059,05931,300,28620,656,0001,196,0002,113,536
7Jun 29, 2026 21:3059,08131,845,44120,676,0001,184,0002,113,536
8Jun 29, 2026 21:3059,15431,953,31320,708,0001,179,0002,113,536
9Jun 29, 2026 21:3059,17831,359,50820,706,0001,190,0002,113,536