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 30, 2026 10:31IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:31033,430,54322,308,0001,210,0002,113,536expected "429496446859 ", got "429496404884 "
2Jun 30, 2026 10:31033,349,30322,221,0001,180,0002,113,536expected "429496527409 ", got "429496488776 "
3Jun 30, 2026 10:31033,445,95622,219,0001,213,0002,113,536expected "429496462873 ", got "429496438294 "