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:49Joad NacerJoad NacerScore: 4,351Success
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:494,29463,128,82933,603,0002,036,0002,306,048
2Oct 14, 2024 00:494,29862,466,08834,656,0001,019,0002,301,952
3Oct 14, 2024 00:494,33760,075,69332,995,0002,999,0002,535,424
4Oct 14, 2024 00:494,34861,056,80535,088,0001,002,0002,306,048
5Oct 14, 2024 00:494,35160,839,73335,107,0001,003,0002,306,048
6Oct 14, 2024 00:494,37357,182,34833,270,0003,024,0002,396,160
7Oct 14, 2024 00:494,37460,932,19335,300,0001,008,0002,531,328
8Oct 14, 2024 00:494,50055,544,59035,334,0002,019,0002,535,424
9Oct 14, 2024 00:494,67960,996,50138,837,00002,306,048