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 listJul 19, 2022 08:46Robert BurkeRobert BurkeScore: 15,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 08:4615,601182,412,479129,492,36302,301,952
2Jul 19, 2022 08:4615,605187,834,525129,521,65702,174,976
3Jul 19, 2022 08:4615,616185,044,837129,614,13702,301,952
4Jul 19, 2022 08:4615,837154,203,956131,446,00002,539,520
5Jul 19, 2022 08:4615,879157,786,178129,800,0001,996,0002,277,376
6Jul 19, 2022 08:4615,885156,325,942131,849,00002,277,376
7Jul 19, 2022 08:4615,901155,071,974130,982,000999,0002,277,376
8Jul 19, 2022 08:4615,901155,166,453130,982,000999,0002,539,520
9Jul 19, 2022 08:4615,906153,054,604131,022,0001,000,0002,433,024
10Jul 19, 2022 08:4615,920151,064,188130,138,0002,002,0002,433,024
11Jul 19, 2022 08:4615,924158,360,258132,166,00002,539,520
12Jul 19, 2022 08:4615,935157,969,314131,262,0001,002,0002,539,520