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:33wnwnScore: 3,640Success
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:333,57243,711,17028,559,0001,092,0002,486,272
2May 7, 2026 10:333,59643,872,48528,780,0001,071,0002,482,176
3May 7, 2026 10:333,60544,848,80028,859,0001,065,0002,486,272
4May 7, 2026 10:333,61344,440,59028,928,0001,060,0002,482,176
5May 7, 2026 10:333,64045,788,31129,154,0001,065,0002,490,368
6May 7, 2026 10:333,73944,833,74629,929,0001,111,0002,486,272
7May 7, 2026 10:333,74845,674,70930,013,0001,098,0002,490,368
8May 7, 2026 10:333,77646,262,30130,253,0001,088,0002,482,176
9May 7, 2026 10:333,78047,821,46530,303,0001,078,0002,486,272