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 16, 2026 22:19izotoffizotoffScore: 138,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:19137,40576,934,91148,847,0001,993,0002,523,136
2Mar 16, 2026 22:19138,15180,667,25249,112,0002,004,0002,314,240
3Mar 16, 2026 22:19138,50877,479,45249,239,0002,009,0002,392,064