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 listAug 10, 2025 14:26Ashish AhujaAshish AhujaScore: 2,031,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2025 14:252,025,00316,836,396,81016,738,558,00068,969,0002,277,376
2Aug 10, 2025 14:252,028,20016,862,612,80616,786,082,00047,980,0002,277,376
3Aug 10, 2025 14:252,031,15516,896,071,08916,792,620,00065,967,0002,277,376
4Aug 10, 2025 14:262,031,54616,892,614,83916,798,855,00062,973,0002,277,376
5Aug 10, 2025 14:262,031,88516,894,470,93916,808,665,00055,978,0002,277,376
6Aug 10, 2025 14:262,039,48316,957,591,85016,853,743,00073,963,0002,277,376