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:42wnwnError
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:43062,654,60352,861,0001,022,0002,113,536expected "53685458240736582 ", got "18446744073709551035 53685458240736582 524128866 0 4 1002 6521021 6442298 6522537 6395840 607204 1788 792 6379899 6427273 6513344 6400790 606043 1730 "
2Sep 24, 2026 13:43062,702,93052,928,0001,017,0002,113,536expected "53674873905215729 ", got "18446744073709551035 53674873905215729 524117245 0 4 1254 6592820 6410757 6450506 6507381 550599 2178 838 6458973 6380494 6444416 6522379 550017 1816 "
3Sep 24, 2026 13:43062,541,02252,827,0001,018,0002,113,536expected "53681525188208301 ", got "18446744073709551035 53681525188208301 524127347 0 4 1182 6590308 6449719 6469622 6397549 562724 1951 880 6453096 6419846 6481171 6380455 561918 1852 "