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 25, 2026 12:28timothygktimothygkScore: 9,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 12:339,21487,544,41566,005,00010,473,0002,117,632stderr
2Oct 25, 2026 12:339,46490,075,98467,510,00011,047,0002,117,632stderr
3Oct 25, 2026 12:339,47289,655,90268,040,00010,579,0002,117,632stderr
4Oct 25, 2026 12:339,57990,642,98068,981,00010,527,0002,117,632stderr
5Oct 25, 2026 12:339,73092,272,64569,386,00011,376,0002,117,632stderr
6Oct 25, 2026 12:339,75292,315,36369,996,00010,952,0002,117,632stderr
7Oct 25, 2026 12:339,78292,616,58470,565,00010,630,0002,117,632stderr
8Oct 25, 2026 12:339,79592,871,36070,520,00010,781,0002,117,632stderr
9Oct 25, 2026 12:339,95295,291,70071,944,00010,660,0002,117,632stderr