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 26, 2025 19:01sheryllynn24sheryllynn24Score: 6,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 19:016,37880,439,19050,940,0001,997,0002,269,184
2Sep 26, 2025 19:016,37886,109,85650,943,0001,997,0002,285,568
3Sep 26, 2025 19:016,37978,876,36850,948,0001,997,0002,285,568
4Sep 26, 2025 19:016,38082,854,88851,953,000999,0002,506,752
5Sep 26, 2025 19:016,38178,082,13150,966,0001,998,0002,265,088
6Sep 26, 2025 19:016,38580,393,77850,997,0001,999,0002,285,568
7Sep 26, 2025 19:016,38982,242,62851,030,0002,001,0002,273,280
8Sep 26, 2025 19:016,39279,075,10952,054,0001,001,0002,523,136
9Sep 26, 2025 19:016,39284,181,65051,054,0002,002,0002,285,568
10Sep 26, 2025 19:016,50278,434,81052,971,000999,0002,285,568
11Sep 26, 2025 19:016,51481,901,45752,068,0002,002,0002,285,568
12Sep 26, 2025 19:016,51781,024,94052,088,0002,003,0002,367,488