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 21, 2024 16:17Vladimir TatVladimir TatScore: 31,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2024 16:1731,872290,546,129263,539,0001,002,0002,273,280
2Oct 21, 2024 16:1731,878292,477,984263,586,0001,002,0002,289,664
3Oct 21, 2024 16:1731,889295,999,312262,683,0001,997,0002,523,136
4Oct 21, 2024 16:1731,896289,549,536262,741,0001,998,0002,531,328
5Oct 21, 2024 16:1731,896295,606,149263,736,000999,0002,289,664
6Oct 21, 2024 16:1731,896289,368,121262,739,0001,998,0002,269,184
7Oct 21, 2024 16:1731,899287,016,520263,766,000999,0002,289,664
8Oct 21, 2024 16:1731,899290,019,938263,766,000999,0002,269,184
9Oct 21, 2024 16:1731,911293,172,021263,859,000999,0002,289,664