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 listJul 3, 2026 19:31Josu San MartinJosu San MartinScore: 19,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:3118,869166,039,845152,844,0003,775,0002,113,536
2Jul 3, 2026 19:3118,903166,923,497153,215,0003,687,0002,113,536
3Jul 3, 2026 19:3118,904166,243,831153,240,0003,668,0002,113,536
4Jul 3, 2026 19:3118,953166,678,308153,710,0003,608,0002,113,536
5Jul 3, 2026 19:3119,046167,513,123154,951,0003,136,0002,113,536
6Jul 3, 2026 19:3119,198168,695,679155,771,0003,573,0002,113,536
7Jul 3, 2026 19:3119,203168,729,905155,708,0003,683,0002,113,536
8Jul 3, 2026 19:3119,372171,458,734157,158,0003,634,0002,113,536
9Jul 3, 2026 19:3119,515171,475,807158,396,0003,582,0002,113,536