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 listAug 30, 2026 22:27Josu San MartinJosu San MartinScore: 5,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:275,82956,916,02347,336,0001,052,0002,113,536
2Aug 30, 2026 22:275,84456,932,17147,473,0001,036,0002,113,536
3Aug 30, 2026 22:275,84556,920,40247,464,0001,050,0002,113,536
4Aug 30, 2026 22:275,84556,899,36247,392,0001,126,0002,113,536
5Aug 30, 2026 22:275,85356,996,43947,551,0001,032,0002,113,536
6Aug 30, 2026 22:275,85557,017,34847,497,0001,103,0002,113,536
7Aug 30, 2026 22:275,85857,023,55647,594,0001,034,0002,113,536
8Aug 30, 2026 22:275,86957,200,99747,609,0001,108,0002,113,536
9Aug 30, 2026 22:275,86957,254,18947,675,0001,043,0002,113,536