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 09:56wnwnScore: 3,434Success
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 09:573,38744,630,10727,050,0001,063,0002,478,080
2May 7, 2026 09:573,40044,865,51027,163,0001,062,0002,490,368
3May 7, 2026 09:573,42444,340,17227,328,0001,098,0002,486,272
4May 7, 2026 09:573,43143,002,23927,393,0001,090,0002,486,272
5May 7, 2026 09:573,43443,608,29627,414,0001,096,0002,486,272
6May 7, 2026 09:573,54945,419,36428,368,0001,091,0002,482,176
7May 7, 2026 09:573,57945,618,65828,635,0001,073,0002,486,272
8May 7, 2026 09:573,59545,319,43928,718,0001,121,0002,486,272
9May 7, 2026 09:573,60944,338,46528,857,0001,102,0002,490,368