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 listMay 1, 2026 02:53Charles CabergsCharles CabergsError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 02:53018,739,21201,587,0002,351,104expected "429496535334 ", got "1 "stderr
2May 1, 2026 02:53018,634,52601,608,0002,363,392expected "429496524323 ", got "1 "stderr
3May 1, 2026 02:53019,438,29701,637,0002,359,296expected "429496534527 ", got "1 "stderr