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 14:44wnwnError
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 14:45038,065,16028,291,0001,009,0002,113,536expected "53693644088247498 ", got "18446744073709551038 53693644088247498 524136246 0 150745 146555 146556 146555 149917 146557 146708 146548 146544 146544 146544 146557 146545 146575 "
2Sep 24, 2026 14:45040,703,68030,237,0001,001,0002,113,536expected "53680672533647556 ", got "18446744073709551038 53680672533647556 524124758 0 148701 146552 146553 146549 146547 146549 146679 146546 146545 146546 146545 146555 146549 146576 "
3Sep 24, 2026 14:45040,513,94930,048,0001,034,0002,113,536expected "53684929283045988 ", got "18446744073709551038 53684929283045988 524127708 0 148803 150956 146552 146549 146550 146547 146689 146554 146544 146545 146545 146553 146546 146571 "