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 21:33nnScore: 142,662Success
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 21:33142,4381,209,796,4761,113,279,00068,955,0002,285,568
2Apr 26, 2025 21:33142,4711,205,704,3831,106,545,00075,968,0002,285,568
3Apr 26, 2025 21:33142,5451,214,788,7021,117,117,00066,006,0002,363,392
4Apr 26, 2025 21:33142,5671,206,385,4581,118,344,00064,961,0002,281,472
5Apr 26, 2025 21:33142,6621,214,025,8711,112,152,00071,945,0002,285,568
6Apr 26, 2025 21:33142,7311,210,265,1121,113,690,00070,980,0002,285,568
7Apr 26, 2025 21:33142,7321,208,011,5121,119,695,00064,982,0002,281,472
8Apr 26, 2025 21:33142,7471,212,897,8861,132,810,00051,991,0002,367,488
9Apr 26, 2025 21:33143,3481,212,379,0251,131,799,00057,989,0002,289,664