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 13, 2025 06:39Ian MckibbenIan MckibbenScore: 50,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 06:3949,977438,962,424412,811,0001,999,0002,273,280
2Jan 13, 2025 06:3950,017438,647,696413,137,0002,000,0002,289,664
3Jan 13, 2025 06:3951,797454,390,292428,919,000999,0002,265,088