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 08:39IlyaIlyaError
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 08:40031,708,18120,964,0001,223,0002,113,536expected "429496562920 ", got "429496474420 "
2Jun 30, 2026 08:4020,968,9437,768,559,5307,601,769,000156,740,0002,113,536
3Jun 30, 2026 08:4021,118,6357,823,558,8527,658,993,000154,902,0002,113,536