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 listDec 6, 2025 15:12Rajarshi BasuRajarshi BasuScore: 6,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:126,18576,165,31849,322,0002,013,0002,289,664
2Dec 6, 2025 15:126,19180,821,67349,373,0002,015,0002,281,472
3Dec 6, 2025 15:126,19575,914,05150,414,0001,008,0002,281,472
4Dec 6, 2025 15:126,19871,642,43549,424,0002,017,0002,281,472
5Dec 6, 2025 15:126,21483,659,31750,568,0001,011,0002,289,664
6Dec 6, 2025 15:126,22382,682,02550,641,0001,012,0002,281,472
7Dec 6, 2025 15:126,23281,484,35948,741,0002,984,0002,293,760
8Dec 6, 2025 15:126,25079,070,12649,884,0001,995,0002,289,664
9Dec 6, 2025 15:126,25778,247,22149,937,0001,997,0002,289,664
10Dec 6, 2025 15:126,33678,097,61250,565,0002,022,0002,289,664
11Dec 6, 2025 15:126,33977,907,58052,610,00002,363,392
12Dec 6, 2025 15:126,34883,194,31050,700,0001,988,0002,273,280