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:26izotoffizotoffScore: 124,551Success
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:26123,93571,234,20844,860,000996,0002,400,256
2Mar 16, 2026 22:26124,55180,435,64344,081,0002,003,0002,396,160
3Mar 16, 2026 22:26124,95970,485,24243,220,0003,015,0002,314,240