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 29, 2026 20:35IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:36032,024,12021,361,0001,167,0002,113,536expected "429496450040 ", got "429496506735 "
2Jun 29, 2026 20:36033,535,12121,282,0001,199,0002,113,536expected "429496515470 ", got "429496581762 "
3Jun 29, 2026 20:36032,017,74721,501,0001,025,0002,113,536expected "429496517662 ", got "429496573314 "