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 9, 2026 12:16wnwnScore: 3,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:163,38340,422,04227,047,0001,034,0002,482,176
2May 9, 2026 12:163,39442,272,72627,132,0001,040,0002,486,272
3May 9, 2026 12:163,46445,511,50327,682,0001,070,0002,482,176
4May 9, 2026 12:163,52945,485,35828,211,0001,080,0002,494,464
5May 9, 2026 12:163,52947,123,87828,226,0001,070,0002,486,272
6May 9, 2026 12:163,55447,610,82928,401,0001,104,0002,482,176
7May 9, 2026 12:163,57247,815,88928,574,0001,077,0002,490,368
8May 9, 2026 12:163,57941,984,71128,662,0001,044,0002,482,176
9May 9, 2026 12:163,59845,565,85328,779,0001,086,0002,490,368