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 11, 2024 09:46Anatoly ZhmurAnatoly ZhmurScore: 87,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:4687,133749,574,879636,304,00086,904,0002,351,104
2Nov 11, 2024 09:4687,174746,533,981637,601,00085,946,0002,334,720
3Nov 11, 2024 09:4687,215753,783,296638,896,00084,986,0002,326,528
4Nov 11, 2024 09:4687,230747,130,131639,010,00085,001,0002,347,008
5Nov 11, 2024 09:4687,364756,855,642645,218,00079,903,0002,338,816
6Nov 11, 2024 09:4687,859759,655,092639,325,00089,905,0002,347,008
7Nov 11, 2024 09:4687,861759,354,603642,335,00086,910,0002,478,080
8Nov 11, 2024 09:4687,938761,948,946637,900,00091,985,0002,330,624
9Nov 11, 2024 09:4687,947760,083,854638,962,00090,994,0002,355,200