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 listApr 26, 2024 22:59Joad NacerJoad NacerScore: 15,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 22:5915,024186,134,657124,702,18102,269,184
2Apr 26, 2024 22:5915,030202,435,754124,744,89102,273,280
3Apr 26, 2024 22:5915,034194,312,818124,779,90202,277,376
4Apr 26, 2024 22:5915,196147,972,656124,122,0002,001,0002,514,944
5Apr 26, 2024 22:5915,200149,003,664124,156,0002,002,0002,285,568
6Apr 26, 2024 22:5915,203150,445,917124,184,0002,002,0002,514,944
7Apr 26, 2024 22:5915,213153,115,013124,260,0002,004,0002,285,568
8Apr 26, 2024 22:5915,215157,716,837124,281,0002,004,0002,506,752
9Apr 26, 2024 22:5915,232150,112,998125,424,0001,003,0002,510,848
10Apr 26, 2024 22:5915,259153,988,019126,650,00002,510,848
11Apr 26, 2024 22:5915,280159,821,170124,828,0001,997,0002,510,848
12Apr 26, 2024 22:5915,828154,782,061130,374,0001,002,0002,519,040