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 20:46Joad NacerJoad NacerScore: 8,678Success
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 20:468,59894,278,11869,357,0002,010,0002,510,848
2Oct 10, 2024 20:468,66599,440,80469,925,0001,997,0002,506,752
3Oct 10, 2024 20:468,66795,589,16768,939,0002,997,0002,334,720
4Oct 10, 2024 20:468,67893,032,17671,025,0001,000,0002,510,848
5Oct 10, 2024 20:468,740104,945,81272,540,00002,330,624
6Oct 10, 2024 20:468,74197,098,15470,537,0002,015,0002,330,624