Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 19, 2026 14:34Ondřej PolaneckýOndřej PolaneckýScore: 10,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:3410,272112,539,41982,251,0003,009,0002,265,088
2Mar 19, 2026 14:3410,297108,021,14083,452,0002,010,0002,396,160
3Mar 19, 2026 14:3410,609110,788,18487,058,0001,000,0002,265,088