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 listJan 1, 2026 05:23KeefeKeefeScore: 74,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 05:2374,20052,082,17026,438,0001,016,0002,392,064
2Jan 1, 2026 05:2374,47855,071,86226,537,0001,020,0002,269,184
3Jan 1, 2026 05:2374,48151,154,67426,574,000984,0002,269,184