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 17, 2024 02:29Sam HughesSam HughesScore: 60,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2024 02:3060,790573,832,746504,555,10802,306,048
2Feb 17, 2024 02:3060,790578,721,970504,560,82102,306,048
3Feb 17, 2024 02:3060,806564,219,336504,685,88802,293,760
4Feb 17, 2024 02:2960,972568,763,816506,066,25302,301,952
5Feb 17, 2024 02:2960,983559,849,963506,163,03902,297,856
6Feb 17, 2024 02:2961,017579,923,842506,442,14402,301,952