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 listAug 10, 2023 18:14temporary-enlightenmenttemporary-enlightenmentScore: 59,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 18:1459,687564,669,776495,401,54202,281,472
2Aug 10, 2023 18:1459,690556,854,473495,427,39202,281,472
3Aug 10, 2023 18:1459,702553,376,776495,528,79002,285,568