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 16:37IlyaIlyaError
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 16:3807,794,654,2827,625,731,000158,893,0002,113,536expected "429496440330 ", got "3644 "
2Jun 30, 2026 16:3807,850,314,9087,684,166,000156,131,0002,113,536expected "429496469512 ", got "1284 "
3Jun 30, 2026 16:3807,776,557,3687,612,245,000154,227,0002,113,536expected "429496465809 ", got "1250 "