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 13:25wnwnError
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 13:250169,452,687159,664,0001,025,0002,113,536expected "53684735836275213 ", got "18446744073709551033 53684735836275213 524127750 0 27851257 26470661 26182405 26453705 26179707 26457393 "
2Sep 24, 2026 13:250170,704,859160,220,0001,018,0002,113,536expected "53683671584306481 ", got "18446744073709551033 53683671584306481 524128903 0 27945650 26491327 26382108 26468715 26413138 26460286 "
3Sep 24, 2026 13:250167,961,221158,137,0001,010,0002,113,536expected "53688339956515404 ", got "18446744073709551033 53688339956515404 524132599 0 26720429 26356696 26154026 26337202 26153827 26349352 "