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 16:05IlyaIlyaScore: 60,727Success
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 16:0659,35931,480,67820,850,0001,113,0002,113,536
2Jun 30, 2026 16:0659,86431,653,91821,025,0001,125,0002,113,536
3Jun 30, 2026 16:0660,03732,181,69020,988,0001,226,0002,113,536
4Jun 30, 2026 16:0660,62932,384,73721,202,0001,231,0002,113,536
5Jun 30, 2026 16:0660,72732,002,76721,373,0001,096,0002,113,536
6Jun 30, 2026 16:0661,06232,073,37821,472,0001,121,0002,113,536
7Jun 30, 2026 16:0620,950,7567,762,289,6437,592,249,000159,531,0002,113,536
8Jun 30, 2026 16:0621,071,6867,806,166,9767,637,860,000158,664,0002,113,536
9Jun 30, 2026 16:0621,086,5297,811,716,7677,647,200,000154,816,0002,113,536