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 listAug 3, 2025 15:03Trinh The SonTrinh The SonScore: 75,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2025 15:0375,764653,709,742570,855,00057,985,0002,273,280
2Aug 3, 2025 15:0375,789651,925,122573,048,00056,004,0002,387,968
3Aug 3, 2025 15:0375,807654,942,892576,185,00053,017,0002,269,184
4Aug 3, 2025 15:0375,811652,014,971572,210,00057,020,0002,285,568
5Aug 3, 2025 15:0375,862654,763,183566,690,00062,965,0002,387,968
6Aug 3, 2025 15:0375,868654,626,125568,734,00060,971,0002,396,160
7Aug 3, 2025 15:0375,883652,316,307568,845,00060,983,0002,273,280
8Aug 3, 2025 15:0375,883657,892,496558,846,00070,980,0002,273,280
9Aug 3, 2025 15:0376,237658,854,964570,788,00061,977,0002,273,280