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 1, 2025 23:12PhibPhibScore: 42,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2025 23:1242,567379,252,058352,310,0001,000,0002,510,848
2Mar 1, 2025 23:1242,571374,682,352351,335,0002,001,0002,506,752
3Mar 1, 2025 23:1242,580387,335,769353,417,00002,281,472
4Mar 1, 2025 23:1242,598380,026,729352,562,0001,001,0002,281,472
5Mar 1, 2025 23:1242,607379,805,085351,645,0001,997,0002,502,656
6Mar 1, 2025 23:1242,609383,883,193349,662,0003,996,0002,506,752
7Mar 1, 2025 23:1242,611378,429,490350,672,0002,997,0002,293,760
8Mar 1, 2025 23:1242,612385,491,424351,680,0001,998,0002,506,752
9Mar 1, 2025 23:1242,615381,700,130352,704,000999,0002,281,472