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 12, 2026 01:40Kevin HeaveyKevin HeaveyScore: 3,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 01:413,93442,294,95931,486,0001,168,0002,117,632
2Jul 12, 2026 01:413,95542,345,80031,657,0001,170,0002,117,632
3Jul 12, 2026 01:413,96642,582,20431,729,0001,191,0002,117,632
4Jul 12, 2026 01:413,96642,572,58431,901,0001,021,0002,117,632
5Jul 12, 2026 01:413,96942,511,42831,778,0001,166,0002,117,632
6Jul 12, 2026 01:413,97442,557,38031,807,0001,180,0002,117,632
7Jul 12, 2026 01:413,99642,756,15132,149,0001,021,0002,117,632
8Jul 12, 2026 01:414,17444,351,47833,485,0001,166,0002,117,632
9Jul 12, 2026 01:414,19444,389,22433,651,0001,167,0002,117,632