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 25, 2025 14:24SSScore: 2,066,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 14:242,062,66817,150,813,05117,050,185,00069,963,0002,277,376
2Aug 25, 2025 14:242,066,89117,190,202,30217,096,225,00058,969,0002,277,376
3Aug 25, 2025 14:242,068,34617,195,700,05517,111,297,00055,974,0002,285,568