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 listApr 26, 2026 15:42wnwnScore: 3,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:463,37745,002,11826,033,0002,002,0002,490,368
2Apr 26, 2026 15:463,43047,352,85027,456,0001,016,0002,490,368
3Apr 26, 2026 15:463,43845,484,57327,524,0001,019,0002,478,080
4Apr 26, 2026 15:463,44045,073,88127,535,0001,019,0002,482,176
5Apr 26, 2026 15:463,44147,496,22327,546,0001,020,0002,494,464
6Apr 26, 2026 15:463,47946,596,15326,886,0001,991,0002,490,368
7Apr 26, 2026 15:463,60144,799,93027,897,0001,992,0002,478,080
8Apr 26, 2026 15:463,60748,524,18427,949,0001,996,0002,478,080
9Apr 26, 2026 15:463,62150,048,65228,058,0002,004,0002,473,984