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 13, 2026 12:43Eric CeglieEric CeglieScore: 26,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:4326,950251,022,938221,688,0001,997,0002,285,568
2Mar 13, 2026 12:4326,956250,400,731221,738,0001,997,0002,285,568
3Mar 13, 2026 12:4326,961251,242,655221,782,0001,998,0002,506,752
4Mar 13, 2026 12:4326,962248,599,816221,789,0001,998,0002,265,088
5Mar 13, 2026 12:4326,965253,936,724221,808,0001,998,0002,285,568
6Mar 13, 2026 12:4326,969252,846,212221,845,0001,998,0002,285,568
7Mar 13, 2026 12:4326,972251,866,576221,867,0001,998,0002,285,568
8Mar 13, 2026 12:4326,976246,526,687222,902,000999,0002,260,992
9Mar 13, 2026 12:4326,976252,687,896221,904,0001,999,0002,285,568