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 26, 2026 19:03TudyMTudyMScore: 124,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 19:03124,50563,012,73545,066,0001,001,0002,555,904
2Apr 26, 2026 19:03124,59161,389,75644,095,0002,004,0002,297,856
3Apr 26, 2026 19:03124,65164,496,49545,119,0001,002,0002,371,584
4Apr 26, 2026 19:03124,65964,895,25244,119,0002,005,0002,363,392
5Apr 26, 2026 19:03124,70869,132,86045,139,0001,003,0002,367,488
6Apr 26, 2026 19:03124,72166,631,50242,135,0004,012,0002,371,584
7Apr 26, 2026 19:03124,74860,501,51244,151,0002,006,0002,301,952
8Apr 26, 2026 19:03124,87566,341,67141,182,0005,022,0002,367,488
9Apr 26, 2026 19:03125,21060,147,61644,314,0002,014,0002,363,392