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 10:17wnwnScore: 3,570Success
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 10:183,38941,596,08527,096,0001,037,0002,482,176
2May 10, 2026 10:183,39643,363,52727,137,0001,053,0002,486,272
3May 10, 2026 10:183,39941,203,63527,164,0001,050,0002,482,176
4May 10, 2026 10:183,47446,201,50927,756,0001,084,0002,482,176
5May 10, 2026 10:183,57046,973,82728,574,0001,059,0002,482,176
6May 10, 2026 10:183,57445,408,95128,572,0001,097,0002,486,272
7May 10, 2026 10:183,59345,141,88828,729,0001,100,0002,478,080
8May 10, 2026 10:183,59447,547,83428,745,0001,088,0002,494,464
9May 10, 2026 10:183,67354,325,34029,403,0001,088,0002,482,176