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 10, 2024 12:11Joad NacerJoad NacerScore: 7,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 12:117,59988,063,94462,070,0001,001,0002,424,832
2Oct 10, 2024 12:117,60081,938,75162,083,0001,001,0002,273,280
3Oct 10, 2024 12:117,60189,861,04861,088,0002,002,0002,535,424
4Oct 10, 2024 12:117,87092,237,02364,315,0001,004,0002,424,832
5Oct 10, 2024 12:117,89093,295,86564,484,0001,007,0002,531,328
6Oct 10, 2024 12:117,89493,670,41365,517,00002,437,120