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 11, 2025 17:25Ian MckibbenIan MckibbenScore: 97,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 17:2597,167828,358,217804,484,0001,998,0002,273,280
2Jan 11, 2025 17:2597,184832,790,081804,628,0001,999,0002,269,184
3Jan 11, 2025 17:2597,201832,239,045802,767,0003,998,0002,281,472