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 listFeb 25, 2025 08:02alfaixalfaixScore: 51,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2025 08:0251,603453,751,897426,303,0002,001,0002,281,472
2Feb 25, 2025 08:0251,615455,702,822428,406,00002,281,472
3Feb 25, 2025 08:0251,621454,187,779426,449,0002,002,0002,281,472
4Feb 25, 2025 08:0251,639460,181,409426,609,0001,998,0002,281,472
5Feb 25, 2025 08:0251,650453,103,624426,700,0001,998,0002,281,472
6Feb 25, 2025 08:0251,656456,615,950426,747,0001,998,0002,281,472
7Feb 25, 2025 08:0251,664454,242,621426,816,0001,999,0002,273,280
8Feb 25, 2025 08:0251,681451,650,791425,955,0002,999,0002,363,392
9Feb 25, 2025 08:0251,781454,739,983426,782,0002,998,0002,281,472