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 8, 2026 17:40IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 17:42031,330,44518,009,0001,036,0002,113,536expected "429496466331 ", got "429496414761 "
2Jul 8, 2026 17:42029,037,02417,579,0001,205,0002,113,536expected "429496486444 ", got "429496439667 "
3Jul 8, 2026 17:42029,061,03117,600,0001,223,0002,113,536expected "429496517104 ", got "429496436876 "