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 21, 2025 19:50alfaixalfaixScore: 1,825,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2025 19:481,818,84515,129,038,59215,023,449,00072,963,0002,285,568
2Feb 21, 2025 19:501,820,42415,143,305,37515,039,553,00069,970,0002,285,568
3Feb 21, 2025 19:481,823,70215,166,828,28715,066,755,00069,970,0002,281,472
4Feb 21, 2025 19:501,825,26515,179,598,19615,080,726,00068,971,0002,277,376
5Feb 21, 2025 19:481,825,59315,184,758,86315,087,448,00064,971,0002,277,376
6Feb 21, 2025 19:502,044,88917,005,682,71916,899,614,00072,968,0002,281,472