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 listApr 30, 2024 02:38Steve HanSteve HanScore: 19,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 02:3818,329206,107,974152,129,14402,256,896
2Apr 30, 2024 02:3818,348223,002,192152,289,53102,256,896
3Apr 30, 2024 02:3818,387212,927,209152,612,71502,256,896
4Apr 30, 2024 02:3819,044232,807,666158,063,33802,265,088
5Apr 30, 2024 02:3819,056219,569,734158,164,87002,265,088
6Apr 30, 2024 02:3819,154221,107,089158,976,25602,248,704