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 listFeb 23, 2025 15:00AndrewAndrewScore: 69,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 15:0068,986600,656,168570,583,0001,998,0002,281,472
2Feb 23, 2025 15:0069,008602,437,579569,771,0002,998,0002,277,376
3Feb 23, 2025 15:0069,047601,360,544571,094,0002,000,0002,277,376
4Feb 23, 2025 15:0069,063601,952,354571,220,0002,000,0002,355,200
5Feb 23, 2025 15:0069,071602,428,720571,290,0002,001,0002,277,376
6Feb 23, 2025 15:0069,073607,281,821572,309,0001,000,0002,269,184
7Feb 23, 2025 15:0069,087602,139,344572,424,0001,000,0002,277,376
8Feb 23, 2025 15:0069,101595,302,437571,537,0001,998,0002,277,376
9Feb 23, 2025 15:0069,162605,074,058569,042,0005,000,0002,277,376