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 listSep 7, 2026 14:54Kevin PetersKevin PetersScore: 67,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:5567,212568,135,691504,353,00053,507,0002,113,536
2Sep 7, 2026 14:5567,250569,090,634504,888,00053,289,0002,113,536
3Sep 7, 2026 14:5567,258569,175,168504,971,00053,271,0002,113,536
4Sep 7, 2026 14:5567,261568,336,566504,064,00054,205,0002,113,536
5Sep 7, 2026 14:5567,283568,618,315505,154,00053,299,0002,113,536
6Sep 7, 2026 14:5567,283569,617,140505,162,00053,292,0002,113,536
7Sep 7, 2026 14:5567,287568,672,250505,194,00053,294,0002,113,536
8Sep 7, 2026 14:5567,330568,901,592504,547,00054,293,0002,113,536
9Sep 7, 2026 14:5567,441569,955,793504,354,00055,407,0002,113,536