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 listSep 20, 2025 20:17sheryllynn24sheryllynn24Score: 9,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 20:179,133100,542,05973,810,0001,994,0002,285,568
2Sep 20, 2025 20:179,135103,433,17374,822,000997,0002,285,568
3Sep 20, 2025 20:179,136105,766,91174,833,000997,0002,285,568
4Sep 20, 2025 20:179,535103,176,96777,137,0002,003,0002,523,136
5Sep 20, 2025 20:179,537104,842,37377,154,0002,004,0002,285,568
6Sep 20, 2025 20:179,538115,030,80677,161,0002,004,0002,519,040
7Sep 20, 2025 20:179,539107,389,83577,168,0002,004,0002,510,848
8Sep 20, 2025 20:179,543108,859,68677,202,0002,005,0002,519,040
9Sep 20, 2025 20:179,546110,674,55877,230,0002,005,0002,285,568
10Sep 20, 2025 20:179,551103,785,67977,270,0002,007,0002,510,848
11Sep 20, 2025 20:179,553106,198,59677,284,0002,007,0002,359,296
12Sep 20, 2025 20:179,557107,738,77976,309,0003,012,0002,285,568