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 7, 2026 10:00wnwnScore: 3,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:013,38743,301,06727,053,0001,060,0002,482,176
2May 7, 2026 10:013,39644,258,31527,088,0001,106,0002,490,368
3May 7, 2026 10:013,39846,455,83327,146,0001,058,0002,482,176
4May 7, 2026 10:013,40045,587,18627,147,0001,077,0002,473,984
5May 7, 2026 10:013,56044,126,88228,471,0001,082,0002,486,272
6May 7, 2026 10:013,57046,843,16528,566,0001,066,0002,486,272
7May 7, 2026 10:013,57248,448,78428,524,0001,130,0002,486,272
8May 7, 2026 10:013,58444,601,52328,666,0001,089,0002,482,176
9May 7, 2026 10:013,62645,904,13928,994,0001,110,0002,482,176