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:07temporary-enlightenmenttemporary-enlightenmentScore: 60,440Success
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:0760,438564,407,799501,633,63602,289,664
2Aug 10, 2023 18:0760,440560,479,991501,655,06602,289,664
3Aug 10, 2023 18:0760,446564,521,689501,703,62202,277,376