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 14, 2024 00:31Joad NacerJoad NacerScore: 4,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:314,75765,702,30736,445,0003,037,0002,310,144
2Oct 14, 2024 00:314,77568,316,69937,599,0002,032,0002,301,952
3Oct 14, 2024 00:314,84866,660,75338,228,0002,012,0002,408,448