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 30, 2024 11:20Anoushk KharangateAnoushk KharangateScore: 49,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 11:2049,105478,453,256407,572,64102,289,664
2Apr 30, 2024 11:2049,115469,257,807407,656,37502,174,976
3Apr 30, 2024 11:1849,133468,583,957407,807,37102,252,800
4Apr 30, 2024 11:2049,180481,036,685408,192,94602,179,072
5Apr 30, 2024 11:2049,206469,477,568408,413,81502,301,952
6Apr 30, 2024 11:1849,225470,818,177408,569,90002,179,072
7Apr 30, 2024 11:2049,235464,239,589408,648,37302,289,664
8Apr 30, 2024 11:2049,275470,320,672408,985,81202,301,952
9Apr 30, 2024 11:1849,276472,024,666408,989,87102,174,976