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 listJan 25, 2025 17:53Giacomo StevanatoGiacomo StevanatoScore: 28,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 17:5328,644264,214,871235,751,0001,997,0002,285,568
2Jan 25, 2025 17:5328,651271,398,124236,807,000999,0002,359,296
3Jan 25, 2025 17:5328,654264,064,502236,832,000999,0002,285,568
4Jan 25, 2025 17:5328,667264,047,507235,939,0001,999,0002,285,568
5Jan 25, 2025 17:5328,671270,353,306235,971,0001,999,0002,285,568
6Jan 25, 2025 17:5328,676266,979,452236,007,0002,000,0002,371,584
7Jan 25, 2025 17:5328,679265,700,196236,038,0002,000,0002,285,568
8Jan 25, 2025 17:5328,683266,591,007236,068,0002,000,0002,285,568
9Jan 25, 2025 17:5328,691266,174,880236,133,0002,001,0002,277,376