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 listAug 23, 2021 09:40Aleksey AkulovichAleksey AkulovichScore: 364,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2021 09:40364,0153,085,168,0243,021,323,23502,277,376
2Aug 23, 2021 09:40364,3193,084,389,8233,023,849,82202,265,088
3Aug 23, 2021 09:40364,5983,076,538,9573,026,161,15002,265,088