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:55wnwnScore: 3,567Success
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:553,44941,486,67127,609,0001,022,0002,310,144
2Apr 27, 2026 05:553,45842,270,70326,727,0001,979,0002,490,368
3Apr 27, 2026 05:553,53345,832,95628,319,0001,011,0002,486,272
4Apr 27, 2026 05:553,54948,438,14428,442,0001,015,0002,486,272
5Apr 27, 2026 05:553,56745,652,27228,593,0001,021,0002,490,368
6Apr 27, 2026 05:553,59543,964,38127,851,0001,989,0002,547,712
7Apr 27, 2026 05:553,60245,169,77127,907,0001,993,0002,486,272
8Apr 27, 2026 05:553,60846,873,34127,957,0001,996,0002,469,888
9Apr 27, 2026 05:553,65045,555,61929,289,0001,009,0002,490,368