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:38032,039,88621,459,0001,027,0002,113,536expected "429496473202 ", got "4056 "
2Jun 30, 2026 16:38032,842,74020,968,0001,106,0002,113,536expected "429496549378 ", got "2149 "
3Jun 30, 2026 16:38031,534,13620,914,0001,123,0002,113,536expected "429496543237 ", got "2056 "