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 31, 2025 16:43AdityaAdityaScore: 66,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 16:4266,304577,236,637550,322,00002,269,184
2Jan 31, 2025 16:4266,312578,849,207549,393,0001,000,0002,486,272
3Jan 31, 2025 16:4366,351573,053,958549,717,000999,0002,510,848
4Jan 31, 2025 16:4266,355581,207,807548,745,0001,999,0002,269,184
5Jan 31, 2025 16:4266,364580,850,528549,821,000999,0002,269,184
6Jan 31, 2025 16:4266,368580,193,713548,856,0001,999,0002,269,184
7Jan 31, 2025 16:4266,404572,917,914550,154,0001,000,0002,269,184
8Jan 31, 2025 16:4366,404576,806,699550,152,0001,000,0002,269,184
9Jan 31, 2025 16:4366,422571,766,911551,299,00002,510,848