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 20:57wnwnError
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 20:580748,399,387737,867,0001,049,0002,113,536expected "53692784054006349 ", got "18446744073709551056 53692784054006349 524138682 0 10006 10001 10012 10012 10024 10026 9993 9998 26292 26292 26293 26324 26363 26286 "
2Sep 24, 2026 20:580741,313,189731,202,0001,117,0002,113,536expected "53688424413639137 ", got "18446744073709551056 53688424413639137 524131363 0 10003 10000 10004 10006 10031 10016 10006 10023 26100 26082 26083 26098 26184 26121 "
3Sep 24, 2026 20:580747,077,466736,879,0001,043,0002,113,536expected "53690451721802805 ", got "18446744073709551056 53690451721802805 524132565 0 9995 9998 10005 9913 10011 10004 9957 9997 26303 26335 26270 26291 26299 26263 "