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:48Joad NacerJoad NacerScore: 7,549Success
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:487,46985,695,59659,994,0001,999,0002,334,720
2Oct 10, 2024 20:487,47586,120,21559,043,0003,002,0002,506,752
3Oct 10, 2024 20:487,47784,825,10159,053,0003,002,0002,502,656
4Oct 10, 2024 20:487,54989,096,19662,659,00002,330,624
5Oct 10, 2024 20:487,56493,545,88560,788,0001,993,0002,506,752
6Oct 10, 2024 20:487,63184,287,30161,328,0002,010,0002,506,752