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 listOct 22, 2026 15:38timothygktimothygkScore: 22,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 15:3921,945193,156,790129,635,00052,512,0002,117,632stderr
2Oct 22, 2026 15:3922,081194,174,667130,273,00053,003,0002,117,632stderr
3Oct 22, 2026 15:3922,159194,792,885131,157,00052,764,0002,117,632stderr
4Oct 22, 2026 15:3922,161194,942,319130,263,00053,679,0002,117,632stderr
5Oct 22, 2026 15:3922,233195,780,328130,511,00054,027,0002,121,728stderr
6Oct 22, 2026 15:3922,350196,407,758131,515,00053,994,0002,121,728stderr
7Oct 22, 2026 15:3922,464197,430,081131,680,00054,774,0002,117,632stderr
8Oct 22, 2026 15:3922,491197,693,777131,771,00054,906,0002,117,632stderr
9Oct 22, 2026 15:3922,508198,248,723131,687,00055,137,0002,117,632stderr