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 10, 2026 08:32Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:32050,078,93533,015,0001,126,0002,486,272expected "53684098311089296 ", got "53684105219931676 "
2May 10, 2026 08:324,09050,005,37832,839,0001,115,0002,482,176
3May 10, 2026 08:324,10749,381,45532,996,0001,094,0002,482,176
4May 10, 2026 08:324,11448,065,98532,983,0001,165,0002,482,176
5May 10, 2026 08:324,11553,229,26333,025,0001,135,0002,482,176
6May 10, 2026 08:324,11549,983,57133,008,0001,151,0002,490,368
7May 10, 2026 08:324,13052,830,69633,153,0001,126,0002,482,176
8May 10, 2026 08:324,14646,644,34833,368,0001,046,0002,490,368
9May 10, 2026 08:324,17151,962,02633,556,0001,065,0002,482,176