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 listApr 26, 2025 03:03nnScore: 353,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2025 03:03351,8762,944,196,9352,863,601,00056,972,0002,281,472
2Apr 26, 2025 03:03351,9202,953,416,7202,871,967,00048,965,0002,281,472
3Apr 26, 2025 03:03352,1002,951,543,5242,853,468,00068,962,0002,355,200
4Apr 26, 2025 03:03352,1452,946,733,7112,853,830,00068,971,0002,285,568
5Apr 26, 2025 03:03353,1922,960,963,8482,852,538,00078,959,0002,285,568
6Apr 26, 2025 03:03355,5962,979,306,8212,891,475,00059,968,0002,281,472
7Apr 26, 2025 03:03356,0002,978,247,7442,892,825,00061,974,0002,359,296
8Apr 26, 2025 03:03357,9062,996,360,0752,899,654,00070,967,0002,281,472
9Apr 26, 2025 03:03358,4252,997,166,1932,915,950,00058,978,0002,285,568