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 listMar 11, 2026 15:09caandocaandoScore: 4,616Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 15:104,58762,222,77736,067,0002,003,0002,482,176
2Mar 11, 2026 15:104,58965,983,51936,083,0002,004,0002,285,568
3Mar 11, 2026 15:104,59159,601,88036,099,0002,005,0002,285,568
4Mar 11, 2026 15:104,60064,490,74836,168,0002,009,0002,478,080
5Mar 11, 2026 15:104,61665,457,34937,302,0001,008,0002,473,984
6Mar 11, 2026 15:104,63458,466,53537,447,0001,012,0002,482,176
7Mar 11, 2026 15:104,63760,795,11036,459,0002,025,0002,285,568
8Mar 11, 2026 15:104,63965,442,65836,476,0002,026,0002,285,568
9Mar 11, 2026 15:104,73563,584,36937,287,0002,015,0002,486,272