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 10:39PhibPhibScore: 35,724Success
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 10:3935,451320,717,180291,239,0003,002,0002,281,472
2Mar 2, 2025 10:3935,526319,632,720291,865,0002,998,0002,510,848
3Mar 2, 2025 10:3935,710320,939,137294,392,0002,002,0002,281,472
4Mar 2, 2025 10:3935,723325,920,261294,499,0002,003,0002,281,472
5Mar 2, 2025 10:3935,724327,883,620295,509,0001,001,0002,506,752
6Mar 2, 2025 10:3935,726330,964,960295,522,0001,001,0002,281,472
7Mar 2, 2025 10:3935,730328,624,191294,560,0001,997,0002,506,752
8Mar 2, 2025 10:3935,733322,384,771293,587,0002,995,0002,506,752
9Mar 2, 2025 10:3935,754318,041,011293,762,0002,997,0002,338,816