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 listMar 21, 2026 20:17izotoffizotoffScore: 80,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:1778,26560,187,11326,961,0001,997,0002,306,048
2Mar 21, 2026 20:1780,07656,391,11727,585,0002,043,0002,301,952
3Mar 21, 2026 20:1780,70060,298,57828,864,000995,0002,342,912