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 10:16wnwnError
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 10:160570,815,303560,849,0001,031,0002,113,536expected "53679667547044125 ", got "18446744073709551020 53679667547044125 25295606878 524124550 0 9989 11091 9905 9894 11101 9996 26315 26316 29202 26048 "
2Sep 24, 2026 10:160573,716,740563,268,0001,041,0002,113,536expected "53688132461930851 ", got "18446744073709551020 53688132461930851 25295779154 524128668 0 10006 11023 9911 9945 11003 9991 26409 26430 29110 26218 "
3Sep 24, 2026 10:160568,937,406558,135,0001,082,0002,113,536expected "53683430129464342 ", got "18446744073709551020 53683430129464342 25295670467 524125573 0 9997 11083 9897 9881 11089 9997 26159 26169 28998 25886 "