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 1, 2025 07:37mebowlermebowlerScore: 82,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 07:3782,379706,624,026639,766,00043,983,0002,527,232
2Feb 1, 2025 07:3782,480709,699,015627,619,00056,965,0002,334,720
3Feb 1, 2025 07:3782,507712,154,223629,825,00054,984,0002,514,944
4Feb 1, 2025 07:3782,509708,725,395618,842,00065,983,0002,334,720
5Feb 1, 2025 07:3782,520708,216,444632,922,00051,993,0002,334,720
6Feb 1, 2025 07:3782,525706,670,797621,962,00062,996,0002,334,720
7Feb 1, 2025 07:3782,552709,975,080631,171,00054,014,0002,523,136
8Feb 1, 2025 07:3782,650706,425,013633,995,00051,999,0002,334,720
9Feb 1, 2025 07:3782,782709,885,226640,015,00047,074,0002,519,040