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 3, 2024 16:02AnSaAnSaScore: 64,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2024 16:1261,207533,106,082507,022,0001,000,0002,273,280
2Dec 13, 2024 16:1261,260536,286,888505,461,0002,996,0002,273,280
3Sep 3, 2024 16:0261,284531,070,476507,655,000999,0002,273,280
4Sep 3, 2024 16:0264,666562,829,374533,726,0002,998,0002,273,280
5Dec 13, 2024 16:1264,707558,070,047536,068,0001,000,0002,273,280
6Sep 3, 2024 16:0267,537589,570,660558,561,0001,998,0002,265,088