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 12:54scompa18scompa18Score: 63,397Success
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 12:5463,193548,003,314305,712,000218,794,0002,457,600
2Jan 5, 2025 12:5463,397553,812,150307,532,000218,667,0002,408,448
3Jan 5, 2025 12:5463,434549,613,355304,711,000221,790,0002,486,272