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:02Josu San MartinJosu San MartinScore: 4,377Success
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:044,35452,247,19535,006,0001,133,0002,555,904
2May 10, 2026 04:044,36353,301,11735,184,0001,031,0002,551,808
3May 10, 2026 04:044,36454,482,14235,196,0001,027,0002,560,000
4May 10, 2026 04:044,36854,837,14935,225,0001,036,0002,555,904
5May 10, 2026 04:044,37751,403,11635,282,0001,051,0002,551,808
6May 10, 2026 04:044,38151,562,39735,257,0001,107,0002,547,712
7May 10, 2026 04:044,38553,744,07335,339,0001,064,0002,551,808
8May 10, 2026 04:044,39054,189,38335,385,0001,055,0002,547,712
9May 10, 2026 04:044,39154,891,85535,246,0001,203,0002,555,904