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 listApr 19, 2026 06:52olliecrowolliecrowScore: 62,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 06:5262,23849,881,09221,026,0002,002,0002,301,952
2Apr 19, 2026 06:5262,85948,605,06021,236,0002,022,0002,531,328
3Apr 19, 2026 06:5262,91653,317,97322,267,0001,012,0002,269,184