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 2, 2025 11:00PhibPhibScore: 33,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2025 11:0032,859297,464,117269,735,0002,997,0002,510,848
2Mar 2, 2025 11:0032,869295,048,980270,811,0001,998,0002,281,472
3Mar 2, 2025 11:0033,038297,353,592272,215,0002,001,0002,281,472
4Mar 2, 2025 11:0033,042298,228,649271,249,0003,002,0002,506,752
5Mar 2, 2025 11:0033,082305,631,373273,575,0001,002,0002,281,472
6Mar 2, 2025 11:0033,099303,596,208271,726,0002,996,0002,510,848
7Mar 2, 2025 11:0033,109297,527,462271,810,0002,997,0002,510,848
8Mar 2, 2025 11:0033,117300,579,926272,871,0001,999,0002,281,472
9Mar 2, 2025 11:0033,125300,578,058272,936,0001,999,0002,281,472