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 listMay 8, 2026 22:35zielajzielajError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 22:36046,811,53127,477,0001,098,0002,420,736expected "53676773121954077 ", got "53676772324888673 "
2May 8, 2026 22:36045,650,49329,003,0001,121,0002,424,832expected "53689021954490522 ", got "53689027280355918 "
3May 8, 2026 22:363,44143,352,02627,453,0001,112,0002,420,736
4May 8, 2026 22:363,53146,549,70828,201,0001,114,0002,437,120
5May 8, 2026 22:363,54845,175,63228,340,0001,114,0002,424,832
6May 8, 2026 22:363,58447,078,40928,630,0001,123,0002,428,928
7May 8, 2026 22:363,63145,053,83029,027,0001,111,0002,424,832
8May 8, 2026 22:363,63545,969,95529,070,0001,103,0002,428,928
9May 8, 2026 22:363,63848,209,67629,058,0001,138,0002,428,928