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 27, 2026 10:07wnwnScore: 3,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:073,43342,880,63027,480,0001,017,0002,486,272
2Apr 27, 2026 10:073,43743,020,49127,515,0001,019,0002,486,272
3Apr 27, 2026 10:073,45149,254,95528,651,00002,486,272
4Apr 27, 2026 10:073,45345,381,02127,643,0001,023,0002,478,080
5Apr 27, 2026 10:073,45346,258,87927,643,0001,023,0002,486,272
6Apr 27, 2026 10:073,45841,362,73126,725,0001,979,0002,486,272
7Apr 27, 2026 10:073,46048,206,06626,739,0001,980,0002,486,272
8Apr 27, 2026 10:073,46146,169,01127,708,0001,026,0002,482,176
9Apr 27, 2026 10:073,50244,901,32727,064,0002,004,0002,490,368