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 09:59PhibPhibScore: 37,396Success
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 09:5937,368331,737,660307,157,0003,001,0002,510,848
2Mar 2, 2025 09:5937,383336,673,011308,277,0002,001,0002,281,472
3Mar 2, 2025 09:5937,384331,499,278309,291,0001,000,0002,281,472
4Mar 2, 2025 09:5937,392340,049,010309,350,0001,001,0002,281,472
5Mar 2, 2025 09:5937,396330,388,242309,385,0001,001,0002,289,664
6Mar 2, 2025 09:5937,406340,708,397308,465,0002,003,0002,502,656
7Mar 2, 2025 09:5937,411345,363,710309,508,0001,001,0002,506,752
8Mar 2, 2025 09:5937,411337,267,245309,510,0001,001,0002,375,680
9Mar 2, 2025 09:5937,416340,508,489309,555,0001,001,0002,510,848