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 10, 2025 17:09RGBCubeRGBCubeScore: 142,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2025 17:09142,6591,213,130,082959,248,000224,823,0002,498,560
2Apr 10, 2025 17:09142,6941,207,386,917957,482,000226,877,0002,457,600
3Apr 10, 2025 17:09142,7571,212,710,909957,097,000227,785,0002,371,584
4Apr 10, 2025 17:09142,8641,213,546,561958,009,000227,764,0002,453,504
5Apr 10, 2025 17:09142,9121,214,451,872958,332,000227,841,0002,260,992
6Apr 10, 2025 17:09143,0001,214,288,398958,113,000228,788,0002,445,312
7Apr 10, 2025 17:09143,0221,218,790,867956,261,000230,821,0002,404,352
8Apr 10, 2025 17:09143,2321,215,673,087961,053,000227,775,0002,502,656
9Apr 10, 2025 17:09143,4271,218,198,138960,550,000229,892,0002,449,408