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 4, 2026 01:06Josu San MartinJosu San MartinScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 01:065,38754,411,49841,143,0003,574,0002,113,536
2Jul 4, 2026 01:065,39054,416,61641,127,0003,610,0002,113,536
3Jul 4, 2026 01:065,41654,603,11841,802,0003,155,0002,113,536
4Jul 4, 2026 01:065,47454,959,96141,862,0003,576,0002,113,536
5Jul 4, 2026 01:065,49955,196,59842,567,0003,078,0002,113,536
6Jul 4, 2026 01:065,52155,529,53542,784,0003,045,0002,113,536
7Jul 4, 2026 01:065,56456,252,97243,029,0003,158,0002,113,536
8Jul 4, 2026 01:066,43364,651,85549,840,0003,561,0002,113,536
9Jul 4, 2026 01:066,50663,637,86850,921,0003,081,0002,113,536