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 19, 2025 08:30SherzodSherzodScore: 668,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 19, 2025 08:30665,5965,557,714,9675,407,522,000116,924,0002,301,952
2Jun 19, 2025 08:30668,0335,582,543,3245,438,736,000105,936,0002,318,336
3Jun 19, 2025 08:30668,0715,575,288,9075,417,082,000127,907,0002,469,888