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 5, 2024 13:05Matthew BookerMatthew BookerScore: 72,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2024 13:0572,884630,382,501602,936,0001,999,0002,269,184
2Sep 5, 2024 13:0572,890628,719,642603,989,000999,0002,273,280
3Sep 5, 2024 13:0572,891628,960,303603,997,000999,0002,289,664
4Sep 5, 2024 13:0572,892631,329,935603,005,0002,000,0002,289,664
5Sep 5, 2024 13:0572,905636,699,155604,108,0001,000,0002,289,664
6Sep 5, 2024 13:0572,907629,227,988603,132,0002,000,0002,289,664
7Sep 5, 2024 13:0572,913632,304,702604,181,0001,000,0002,289,664
8Sep 5, 2024 13:0572,916640,761,918604,200,0001,000,0002,269,184
9Sep 5, 2024 13:0572,932635,345,159603,336,0001,997,0002,289,664