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 07:24wnwnError
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 07:24041,546,01528,192,0001,934,0002,117,632expected "53687279556978877 ", got "18446744069414649869 53687279556978877 0 0 4 8589934592 0 0 16914836 2198593758822400 2190227162529792 15 "
2Sep 24, 2026 07:24039,488,77228,187,0001,917,0002,117,632expected "53685944853269469 ", got "18446744069414649869 53685944853269469 0 0 8 12884901888 0 0 16914836 2198576578953216 2190227162529792 15 "
3Sep 24, 2026 07:24039,180,27127,781,0001,923,0002,117,632expected "53682317043515116 ", got "18446744069414649869 53682317043515116 0 0 2 4294967296 0 0 16914836 2198593758822400 2190227162529792 15 "