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 04:21wnwnScore: 3,550Success
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 04:213,52438,025,79528,236,0001,017,0002,113,536
2Sep 24, 2026 04:213,52838,053,87728,278,0001,006,0002,113,536
3Sep 24, 2026 04:213,54139,681,51328,389,0001,003,0002,113,536
4Sep 24, 2026 04:213,54637,996,42628,418,0001,022,0002,113,536
5Sep 24, 2026 04:213,55038,261,56428,430,0001,039,0002,113,536
6Sep 24, 2026 04:213,55038,207,33228,464,0001,007,0002,113,536
7Sep 24, 2026 04:213,57038,729,72028,602,0001,035,0002,113,536
8Sep 24, 2026 04:213,63138,956,41729,099,0001,043,0002,113,536
9Sep 24, 2026 04:213,69139,555,48129,609,0001,032,0002,113,536