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 listAug 22, 2025 13:44Ashish AhujaAshish AhujaScore: 11,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 13:4411,275121,250,83774,670,00018,916,0002,502,656
2Aug 22, 2025 13:4411,277122,031,95774,678,00018,918,0002,437,120
3Aug 22, 2025 13:4411,416120,533,00877,798,00016,956,0002,506,752
4Aug 22, 2025 13:4411,741124,813,56179,554,00017,899,0002,408,448
5Aug 22, 2025 13:4411,762126,261,48477,703,00019,924,0002,510,848
6Aug 22, 2025 13:4412,044126,852,20779,183,00020,785,0002,273,280