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 21, 2025 07:57sheryllynn24sheryllynn24Score: 8,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 07:578,06194,733,49365,908,000998,0002,289,664
2Sep 21, 2025 07:578,12695,900,78266,438,0001,006,0002,269,184
3Sep 21, 2025 07:578,54696,789,50868,933,0001,998,0002,289,664
4Sep 21, 2025 07:578,551101,868,64368,974,0001,999,0002,523,136
5Sep 21, 2025 07:578,566106,348,84369,093,0002,002,0002,289,664
6Sep 21, 2025 07:578,56698,861,53469,092,0002,002,0002,383,872
7Sep 21, 2025 07:578,56997,120,88869,118,0002,003,0002,285,568
8Sep 21, 2025 07:578,57297,209,23369,146,0002,004,0002,289,664
9Sep 21, 2025 07:578,57399,157,19469,151,0002,004,0002,289,664
10Sep 21, 2025 07:578,582103,463,14769,224,0002,006,0002,527,232
11Sep 21, 2025 07:578,64298,161,50769,738,0001,992,0002,527,232
12Sep 21, 2025 07:578,66297,707,08670,896,000998,0002,510,848