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 9, 2025 20:43alxmrcktralxmrcktrScore: 215,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 20:43215,1641,813,150,7861,711,912,00073,953,0002,359,296
2Feb 9, 2025 20:43215,1751,816,113,7081,726,984,00058,965,0002,289,664
3Feb 9, 2025 20:43215,2681,811,326,5451,720,734,00065,989,0002,285,568
4Feb 9, 2025 20:43215,2751,814,471,1221,720,831,00065,955,0002,277,376
5Feb 9, 2025 20:43215,2761,816,639,1091,715,838,00070,951,0002,285,568
6Feb 9, 2025 20:43217,3561,829,370,3231,718,100,00085,955,0002,289,664
7Feb 9, 2025 20:43217,3641,830,585,3281,739,154,00064,968,0002,289,664
8Feb 9, 2025 20:43217,4601,837,829,6431,729,962,00074,955,0002,285,568
9Feb 9, 2025 20:43217,5011,836,633,3411,735,284,00069,971,0002,281,472