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 listDec 19, 2024 18:06Javid izadiJavid izadiScore: 380,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 18:06377,6763,157,977,6323,071,735,00062,974,0002,281,472
2Dec 19, 2024 18:06378,4003,163,329,4023,073,747,00066,972,0002,281,472
3Dec 19, 2024 18:06378,8263,168,956,0243,076,295,00067,962,0002,289,664
4Dec 19, 2024 18:06379,2303,171,799,7333,080,637,00066,970,0002,289,664
5Dec 19, 2024 18:06380,1853,188,581,9373,099,560,00055,974,0002,285,568
6Dec 19, 2024 18:06380,9093,195,736,9843,108,567,00052,975,0002,285,568
7Dec 19, 2024 18:06380,9423,191,387,0393,098,863,00062,956,0002,281,472
8Dec 19, 2024 18:06385,7813,236,003,3923,141,043,00060,942,0002,285,568
9Dec 19, 2024 18:06415,5583,482,766,7393,386,170,00062,965,0002,285,568