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 21, 2026 12:40olliecrowolliecrowScore: 5,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 12:385,78771,338,19245,034,0003,002,0002,326,528
2Mar 21, 2026 12:385,82776,238,62743,330,0005,038,0002,363,392
3Mar 21, 2026 12:385,85171,300,95444,514,0004,046,0002,428,928
4Mar 21, 2026 12:405,89274,707,53544,909,0003,991,0002,523,136
5Mar 21, 2026 12:405,93674,036,36146,250,0003,016,0002,347,008
6Mar 21, 2026 12:406,07970,829,31345,409,0005,045,0002,334,720