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 14, 2026 21:02olliecrowolliecrowScore: 60,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 21:0260,06544,036,35820,204,0002,020,0002,498,560
2Apr 14, 2026 21:0260,38141,931,45720,310,0002,031,0002,498,560
3Apr 14, 2026 21:0260,38950,975,62621,329,0001,015,0002,494,464