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 listMay 10, 2026 04:13Josu San MartinJosu San MartinScore: 4,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:134,33451,159,09234,871,0001,109,0002,535,424
2May 10, 2026 04:134,35651,329,60935,137,0001,026,0002,560,000
3May 10, 2026 04:134,36154,373,97335,158,0001,046,0002,547,712
4May 10, 2026 04:134,37052,434,91735,238,0001,039,0002,547,712
5May 10, 2026 04:134,37148,762,41235,263,0001,022,0002,560,000
6May 10, 2026 04:134,37451,821,63535,233,0001,079,0002,547,712
7May 10, 2026 04:134,37553,483,69435,271,0001,048,0002,547,712
8May 10, 2026 04:134,38452,174,30635,326,0001,068,0002,547,712
9May 10, 2026 04:134,54353,333,87235,572,0002,139,0002,551,808