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:05bendnbendnScore: 88,034Success
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:0588,030756,602,624728,654,0001,999,0002,289,664
2Jan 25, 2025 17:0588,034757,519,430728,684,0001,999,0002,289,664
3Jan 25, 2025 17:0588,057752,430,789728,871,0001,999,0002,363,392