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 17, 2026 19:12Kevin HeaveyKevin HeaveyScore: 3,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 19:203,68650,139,00829,551,0001,044,0002,113,536
2Jul 17, 2026 19:203,69540,464,25029,628,0001,048,0002,113,536
3Jul 17, 2026 19:203,90142,189,03831,184,0001,199,0002,113,536
4Jul 17, 2026 19:203,91142,398,33931,422,0001,046,0002,113,536
5Jul 17, 2026 19:203,93542,496,07031,623,0001,042,0002,113,536
6Jul 17, 2026 19:203,93642,534,71931,627,0001,044,0002,113,536
7Jul 17, 2026 19:203,95042,715,38231,771,0001,020,0002,113,536
8Jul 17, 2026 19:203,95852,487,89131,811,0001,043,0002,113,536
9Jul 17, 2026 19:204,01343,192,15832,266,0001,043,0002,113,536