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 listJul 7, 2026 13:09IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:10031,891,53320,706,0001,209,0002,113,536expected "429496536685 ", got "429496536038 "
2Jul 7, 2026 13:10032,286,98020,908,0001,215,0002,113,536expected "429496587880 ", got "429496578720 "
3Jul 7, 2026 13:1059,11831,518,95220,720,0001,154,0002,113,536