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 listFeb 9, 2025 02:08Code HintsCode HintsScore: 72,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 02:0872,375628,514,907598,717,0001,999,0002,535,424
2Feb 9, 2025 02:0872,766631,687,626602,959,000999,0002,535,424
3Feb 9, 2025 02:0872,776626,987,808603,042,0001,000,0002,437,120