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:25izotoffizotoffScore: 124,497Success
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:25123,93574,177,69243,863,0001,993,0002,318,336
2Mar 16, 2026 22:25124,49770,335,03543,060,0003,004,0002,396,160
3Mar 16, 2026 22:25125,01975,443,63144,246,0002,011,0002,314,240