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:35wnwnScore: 3,489Success
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:353,42141,178,66027,318,0001,084,0002,494,464
2May 7, 2026 10:353,42243,005,05927,342,0001,065,0002,486,272
3May 7, 2026 10:353,43244,417,34327,429,0001,061,0002,490,368
4May 7, 2026 10:353,43946,683,00327,446,0001,103,0002,482,176
5May 7, 2026 10:353,48944,670,47227,892,0001,074,0002,490,368
6May 7, 2026 10:353,58046,923,20928,656,0001,058,0002,486,272
7May 7, 2026 10:353,59845,351,03228,802,0001,066,0002,478,080
8May 7, 2026 10:353,62844,355,23029,023,0001,094,0002,486,272
9May 7, 2026 10:353,65447,503,10329,259,0001,070,0002,482,176