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 listSep 24, 2026 16:17wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 16:17062,635,63352,814,0001,060,0002,113,536expected "53684810446407590 ", got "18446744073709551042 53684810446407590 524128331 0 3 2311548 4351269 0 0 0 0 0 0 0 2 2163856 4277413 0 0 0 0 0 0 0 0 "
2Sep 24, 2026 16:17062,551,26052,742,0001,046,0002,113,536expected "53687875270181330 ", got "18446744073709551042 53687875270181330 524131685 0 3 2338545 4261403 0 0 0 0 0 0 0 0 2201906 4243124 0 0 0 0 0 0 0 0 "
3Sep 24, 2026 16:17064,702,37654,359,0001,029,0002,113,536expected "53689935044630475 ", got "18446744073709551042 53689935044630475 524132038 0 3 3622752 4561832 0 0 0 0 0 0 0 0 2249063 4251300 0 0 0 0 0 0 0 0 "