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 listDec 27, 2025 18:29Josu San MartinJosu San MartinScore: 32,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 18:2932,227291,485,888266,487,0001,001,0002,351,104
2Dec 27, 2025 18:2932,230295,919,199267,511,00002,281,472
3Dec 27, 2025 18:2932,236293,343,174267,555,00002,359,296
4Dec 27, 2025 18:2932,252297,587,755266,696,000998,0002,289,664
5Dec 27, 2025 18:2932,253295,375,033266,698,000998,0002,461,696
6Dec 27, 2025 18:2932,256293,986,785266,724,000998,0002,285,568
7Dec 27, 2025 18:2932,260295,743,104266,755,000999,0002,285,568
8Dec 27, 2025 18:2932,271294,161,572266,848,000999,0002,281,472
9Dec 27, 2025 18:2932,275300,574,168264,884,0002,998,0002,285,568