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 30, 2025 00:52Andrew AshworthAndrew AshworthScore: 423,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2025 00:52423,1893,541,314,9983,359,534,000152,933,0002,260,992
2May 30, 2025 00:52423,3513,544,260,7513,345,920,000167,895,0002,277,376
3May 30, 2025 00:52423,3693,545,569,5433,343,060,000170,900,0002,277,376
4May 30, 2025 00:52423,6943,541,130,3513,346,729,000169,935,0002,461,696
5May 30, 2025 00:52423,8303,548,557,6533,342,897,000174,890,0002,273,280
6May 30, 2025 00:52423,9043,544,399,1313,355,480,000162,926,0002,449,408
7May 30, 2025 00:52423,9133,549,950,6353,347,550,000170,926,0002,375,680
8May 30, 2025 00:52424,0903,556,082,5423,349,051,000170,900,0002,277,376
9May 30, 2025 00:52424,5933,548,301,0833,363,207,000160,914,0002,273,280