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 listDec 24, 2024 11:49Sean DewarSean DewarScore: 58,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 11:4958,035511,771,005479,695,0001,998,0002,289,664
2Dec 24, 2024 11:4958,150508,304,352480,647,0001,998,0002,281,472
3Dec 24, 2024 11:4958,348508,547,107483,292,0001,000,0002,277,376
4Dec 24, 2024 11:4958,355513,728,588483,350,0001,000,0002,289,664
5Dec 24, 2024 11:4958,372509,706,891482,494,0001,997,0002,281,472
6Dec 24, 2024 11:4958,383514,680,660482,577,0001,998,0002,387,968
7Dec 24, 2024 11:4958,397515,501,199482,695,0001,998,0002,289,664
8Dec 24, 2024 11:4958,399519,696,148482,717,0001,998,0002,281,472
9Dec 24, 2024 11:4958,402511,024,363482,738,0001,998,0002,289,664