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 listOct 30, 2025 06:30Anton SkvortsovAnton SkvortsovScore: 184,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2025 06:30183,5801,551,136,3441,291,908,000231,804,0002,519,040
2Oct 30, 2025 06:30183,6321,549,169,9261,294,278,000229,871,0002,318,336
3Oct 30, 2025 06:30183,9571,548,151,9741,294,021,000232,823,0002,457,600
4Oct 30, 2025 06:30184,5341,554,619,0421,299,837,000231,792,0002,473,984
5Oct 30, 2025 06:30184,6161,558,696,1871,299,416,000232,895,0002,469,888
6Oct 30, 2025 06:30185,6141,567,726,1651,304,811,000235,785,0002,367,488
7Oct 30, 2025 06:30185,7331,574,987,7291,311,799,000229,789,0002,519,040
8Oct 30, 2025 06:30186,0401,573,021,8631,310,264,000233,868,0002,469,888
9Oct 30, 2025 06:30186,9981,576,577,6851,319,223,000232,862,0002,387,968