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:04PhibPhibScore: 35,505Success
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:0435,397320,388,871291,796,0001,998,0002,281,472
2Mar 2, 2025 10:0435,449321,861,713289,227,0005,003,0002,510,848
3Mar 2, 2025 10:0435,480326,800,122292,478,0002,003,0002,281,472
4Mar 2, 2025 10:0435,485323,603,377292,525,0002,003,0002,281,472
5Mar 2, 2025 10:0435,505320,384,351292,691,0001,997,0002,281,472
6Mar 2, 2025 10:0435,510323,818,185291,733,0002,997,0002,281,472
7Mar 2, 2025 10:0435,515319,147,356293,776,000999,0002,519,040
8Mar 2, 2025 10:0435,528318,317,190291,886,0002,998,0002,510,848
9Mar 2, 2025 10:0435,637322,280,581291,794,0003,997,0002,506,752