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 listOct 11, 2024 16:48Joad NacerJoad NacerScore: 4,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:484,44959,836,84234,931,0001,996,0002,351,104
2Oct 11, 2024 16:484,47363,074,00036,125,0001,003,0002,297,856
3Oct 11, 2024 16:484,47562,948,39634,128,0003,011,0002,351,104
4Oct 11, 2024 16:484,50854,978,21635,393,0002,022,0002,301,952
5Oct 11, 2024 16:484,53262,835,29435,582,0002,033,0002,351,104
6Oct 11, 2024 16:484,55462,945,72135,808,0001,989,0002,351,104