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:47wnwnScore: 3,527Success
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:483,43543,847,35427,456,0001,056,0002,490,368
2May 7, 2026 10:483,44841,704,48227,537,0001,084,0002,486,272
3May 7, 2026 10:483,45445,445,42427,592,0001,079,0002,494,464
4May 7, 2026 10:483,46043,901,11027,643,0001,078,0002,486,272
5May 7, 2026 10:483,52743,793,97028,214,0001,067,0002,490,368
6May 7, 2026 10:483,58445,294,22128,642,0001,112,0002,482,176
7May 7, 2026 10:483,61644,534,50728,920,0001,100,0002,478,080
8May 7, 2026 10:483,61746,558,90828,935,0001,092,0002,486,272
9May 7, 2026 10:483,66243,071,48129,317,0001,085,0002,486,272