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 listDec 8, 2024 14:49MatthiasMatthiasScore: 9,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 14:499,111103,743,68474,616,0001,008,0002,277,376
2Dec 8, 2024 14:499,120105,216,37174,690,0001,009,0002,285,568
3Dec 8, 2024 14:499,129107,051,72774,773,000996,0002,285,568
4Dec 8, 2024 14:499,137106,517,57074,836,000997,0002,265,088
5Dec 8, 2024 14:499,140104,273,58674,867,000998,0002,285,568
6Dec 8, 2024 14:499,14198,581,32173,872,0001,996,0002,285,568