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 05:32wnwnScore: 3,587Success
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 05:323,43046,685,44127,459,0001,017,0002,490,368
2Apr 27, 2026 05:323,46941,817,94326,811,0001,986,0002,482,176
3Apr 27, 2026 05:323,57143,100,38528,624,0001,022,0002,486,272
4Apr 27, 2026 05:323,58042,343,33028,692,0001,024,0002,486,272
5Apr 27, 2026 05:323,58749,368,39228,747,0001,026,0002,486,272
6Apr 27, 2026 05:323,58945,653,74327,807,0001,986,0002,478,080
7Apr 27, 2026 05:323,60851,530,91727,955,0001,996,0002,490,368
8Apr 27, 2026 05:323,62346,651,39428,068,0002,004,0002,482,176
9Apr 27, 2026 05:323,63546,515,98429,171,0001,005,0002,486,272