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 18:42Ian MckibbenIan MckibbenScore: 44,592Success
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 18:4243,248385,830,812356,958,0001,999,0002,289,664
2Jan 11, 2025 18:4243,249389,530,919356,971,0001,999,0002,510,848
3Jan 11, 2025 18:4243,264387,670,068358,089,0001,000,0002,281,472
4Jan 11, 2025 18:4244,592393,248,502369,111,0001,000,0002,510,848
5Jan 11, 2025 18:4244,610392,820,710370,262,00002,289,664
6Jan 11, 2025 18:4244,619395,991,932369,341,0001,000,0002,506,752