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 5, 2025 08:19scompa18scompa18Score: 85,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 08:1985,605743,542,045487,671,000222,849,0002,424,832
2Jan 5, 2025 08:1985,683741,602,766487,431,000223,739,0002,408,448
3Jan 5, 2025 08:1985,686738,869,158488,445,000222,746,0002,482,176