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 listFeb 16, 2024 08:56Huy Duc LeHuy Duc LeScore: 21,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 08:5621,190236,176,203175,877,37102,285,568
2Feb 16, 2024 08:5621,212227,690,014176,058,45202,281,472
3Feb 16, 2024 08:5622,302240,771,530185,104,79202,285,568