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 08:41wnwnScore: 3,428Success
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 08:423,38944,434,28927,062,0001,068,0002,486,272
2May 7, 2026 08:423,40643,906,25027,175,0001,100,0002,482,176
3May 7, 2026 08:423,40844,424,42227,231,0001,058,0002,490,368
4May 7, 2026 08:423,40845,104,58327,191,0001,099,0002,478,080
5May 7, 2026 08:423,42846,304,79527,348,0001,110,0002,490,368
6May 7, 2026 08:423,55647,196,43428,423,0001,100,0002,482,176
7May 7, 2026 08:423,57045,886,36928,517,0001,117,0002,482,176
8May 7, 2026 08:423,59546,320,68128,726,0001,118,0002,486,272
9May 7, 2026 08:423,59949,121,26628,756,0001,122,0002,490,368