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 listNov 21, 2024 16:18KrishanKrishanScore: 75,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2024 16:1875,302648,668,730624,008,0001,000,0002,293,760
2Nov 21, 2024 16:1875,310651,828,037624,071,0001,000,0002,293,760
3Nov 21, 2024 16:1875,315654,871,141625,114,00002,293,760
4Nov 21, 2024 16:1875,320650,648,075624,160,0001,000,0002,285,568
5Nov 21, 2024 16:1875,326647,096,363625,207,00002,371,584
6Nov 21, 2024 16:1875,327649,466,053624,216,0001,000,0002,293,760
7Nov 21, 2024 16:1875,328646,764,458624,224,0001,000,0002,285,568
8Nov 21, 2024 16:1875,350653,100,708624,403,0001,000,0002,293,760
9Nov 21, 2024 16:1875,369650,931,819623,565,0001,998,0002,371,584