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 14, 2024 00:21Joad NacerJoad NacerScore: 4,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:214,27955,689,47532,470,0003,044,0002,306,048
2Oct 14, 2024 00:214,28966,664,85833,564,0002,034,0002,301,952
3Oct 14, 2024 00:214,44362,345,69235,884,000996,0002,531,328
4Oct 14, 2024 00:214,46361,197,83836,042,0001,001,0002,273,280
5Oct 14, 2024 00:214,57663,017,01536,982,000999,0002,289,664
6Oct 14, 2024 00:214,83162,912,55439,092,0001,002,0002,392,064