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 4, 2025 06:32thatmagicalcatthatmagicalcatScore: 56,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 06:3256,029494,322,535463,037,0002,000,0002,547,712
2Jun 4, 2025 06:3256,072493,938,366463,393,0002,001,0002,285,568
3Jun 4, 2025 06:3256,079500,641,135465,459,00002,351,104
4Jun 4, 2025 06:3256,097492,301,604463,605,0001,998,0002,363,392
5Jun 4, 2025 06:3256,106490,710,945463,679,0001,998,0002,453,504
6Jun 4, 2025 06:3256,119496,101,375463,786,0001,999,0002,285,568
7Jun 4, 2025 06:3256,133488,540,179463,906,0001,999,0002,453,504
8Jun 4, 2025 06:3256,143490,744,113464,987,000999,0002,285,568
9Jun 4, 2025 06:3256,231496,493,282465,717,000999,0002,285,568