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:04temporary-enlightenmenttemporary-enlightenmentScore: 59,947Success
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:0459,937555,153,221497,476,72402,293,760
2Aug 10, 2023 18:0459,947552,339,927497,558,04302,293,760
3Aug 10, 2023 18:0459,958556,523,510497,652,86002,281,472