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 11, 2024 02:36Joad NacerJoad NacerScore: 4,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 02:364,53163,927,47635,572,0002,032,0002,334,720
2Oct 11, 2024 02:364,53360,827,40835,587,0002,033,0002,334,720
3Oct 11, 2024 02:364,55666,390,40836,819,000995,0002,514,944
4Oct 11, 2024 02:364,60762,992,84637,228,0001,006,0002,330,624
5Oct 11, 2024 02:364,61158,841,54338,271,00002,330,624
6Oct 11, 2024 02:364,61257,492,32036,265,0002,014,0002,338,816