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 listMay 29, 2024 18:56GraceGraceScore: 6,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2024 18:566,472118,734,88453,720,18802,187,264
2May 29, 2024 18:566,509141,976,14154,022,06302,183,168
3May 29, 2024 18:566,530110,058,73354,196,43302,187,264
4May 29, 2024 18:566,531113,591,66954,206,28302,256,896
5May 29, 2024 18:566,531119,351,76154,211,44302,310,144
6May 29, 2024 18:566,545114,637,84654,320,92502,183,168
7May 29, 2024 18:566,545127,391,95154,323,69202,179,072
8May 29, 2024 18:566,555111,843,85754,404,77502,179,072
9May 29, 2024 18:566,612130,612,16654,879,24002,187,264
10May 29, 2024 18:566,643129,522,54355,134,77602,187,264
11May 29, 2024 18:566,722132,426,94255,791,97402,183,168
12May 29, 2024 18:566,750123,527,81256,022,66602,187,264