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 2, 2024 02:34Abhijit RamanAbhijit RamanScore: 87,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2024 02:3487,503755,792,379504,498,000221,779,0002,400,256
2Oct 2, 2024 02:3487,575750,361,321505,914,000220,962,0002,400,256
3Oct 2, 2024 02:3487,640754,835,447503,595,000223,820,0002,457,600
4Oct 2, 2024 02:3487,794754,057,088503,788,000224,905,0002,469,888
5Oct 2, 2024 02:3487,830755,241,440503,995,000224,997,0002,297,856
6Oct 2, 2024 02:3487,986758,823,954503,505,000226,777,0002,265,088
7Oct 2, 2024 02:3488,103757,711,951503,486,000227,767,0002,465,792
8Oct 2, 2024 02:3488,412756,881,222511,875,000221,945,0002,351,104
9Oct 2, 2024 02:3488,528761,445,824505,849,000228,931,0002,281,472