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 21, 2026 19:54Dominique GarmierDominique GarmierScore: 8,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:568,69495,399,52171,160,0001,002,0002,347,008
2Mar 21, 2026 19:548,71398,126,66972,314,00002,330,624
3Mar 21, 2026 19:568,71396,988,55871,314,0001,004,0002,310,144
4Mar 21, 2026 19:508,76397,418,05170,741,0001,992,0002,330,624
5Mar 21, 2026 19:508,815102,515,06071,161,0002,004,0002,330,624
6Mar 21, 2026 19:548,85796,637,82172,503,0001,006,0002,334,720
7Mar 21, 2026 19:568,893102,739,50172,816,000997,0002,306,048
8Mar 21, 2026 19:508,96799,190,04074,423,00002,301,952
9Mar 21, 2026 19:549,034102,978,05473,983,000999,0002,301,952