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 23:23IlyaIlyaError
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 23:23031,149,67020,444,0001,147,0002,113,536expected "429496488853 ", got "429496536491 "
2Jul 8, 2026 23:23031,226,53520,484,0001,103,0002,113,536expected "429496469941 ", got "429496516923 "
3Jul 8, 2026 23:23031,262,24920,506,0001,122,0002,113,536expected "429496483780 ", got "429496521502 "