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 listJun 11, 2025 09:48cdillondcdillondScore: 173,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2025 09:48172,7881,463,472,2811,348,192,00085,948,0002,523,136
2Jun 11, 2025 09:48172,8291,457,934,7241,347,511,00086,968,0002,338,816
3Jun 11, 2025 09:48172,8571,458,404,8381,325,735,000108,978,0002,527,232
4Jun 11, 2025 09:48172,9611,458,621,0511,341,602,00093,972,0002,387,968
5Jun 11, 2025 09:48173,0331,465,671,1951,333,237,000102,941,0002,338,816
6Jun 11, 2025 09:48173,0341,461,682,3481,318,249,000117,932,0002,338,816
7Jun 11, 2025 09:48173,2481,463,270,1591,328,965,000108,997,0002,527,232
8Jun 11, 2025 09:48173,4671,462,729,8411,363,792,00075,988,0002,338,816
9Jun 11, 2025 09:48174,1201,473,296,9281,353,250,00091,949,0002,338,816