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 3, 2021 18:25Sergey SamokhvalovSergey SamokhvalovScore: 27,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 18:2527,098252,839,838173,936,00050,981,0002,523,136
2Jul 3, 2021 18:2527,153246,828,935172,283,00053,087,0002,519,040
3Jul 3, 2021 18:2527,154247,846,605168,280,00057,095,0002,387,968
4Jul 3, 2021 18:2527,187265,156,555225,649,32202,342,912
5Jul 3, 2021 18:2527,211253,980,909166,889,00058,960,0002,392,064
6Jul 3, 2021 18:2527,214252,752,986167,910,00057,969,0002,383,872
7Jul 3, 2021 18:2527,218262,779,046225,911,93402,355,200
8Jul 3, 2021 18:2527,223289,005,958225,953,82602,359,296
9Jul 3, 2021 18:2527,309254,121,591168,751,00057,914,0002,387,968
10Jul 3, 2021 18:2527,377247,963,182173,177,00054,055,0002,510,848
11Jul 3, 2021 18:2527,396251,737,006165,282,00062,106,0002,519,040
12Jul 3, 2021 18:2527,411247,569,929171,383,00056,125,0002,519,040