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 18, 2025 06:04Ashish AhujaAshish AhujaScore: 11,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 06:0411,641125,238,80687,657,0008,964,0002,355,200
2Aug 18, 2025 06:0411,664119,747,28587,828,0008,982,0002,347,008
3Aug 18, 2025 06:0411,700119,325,26789,102,0008,009,0002,523,136
4Aug 18, 2025 06:0411,704118,824,40288,131,0009,013,0002,433,024
5Aug 18, 2025 06:0411,845125,836,31192,291,0006,019,0002,297,856
6Aug 18, 2025 06:0412,787131,578,425101,130,0005,006,0002,347,008