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:17PhibPhibScore: 42,589Success
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:1742,565380,000,760351,292,0002,001,0002,281,472
2Mar 1, 2025 23:1742,569375,889,171352,326,0001,000,0002,506,752
3Mar 1, 2025 23:1742,583377,589,341352,442,0001,001,0002,281,472
4Mar 1, 2025 23:1742,586382,960,580351,459,0002,002,0002,281,472
5Mar 1, 2025 23:1742,589377,394,691351,490,0001,997,0002,281,472
6Mar 1, 2025 23:1742,597386,976,054351,556,0001,997,0002,281,472
7Mar 1, 2025 23:1742,613382,063,889350,690,0002,997,0002,281,472
8Mar 1, 2025 23:1742,613381,235,412350,694,0002,997,0002,281,472
9Mar 1, 2025 23:1742,614383,630,487351,701,0001,998,0002,510,848