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 3, 2023 07:36Erdem KeskinErdem KeskinScore: 85,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 07:3085,237774,001,800707,463,44002,228,224
2Jul 3, 2023 07:4185,256772,136,357707,627,58602,240,512
3Jul 3, 2023 07:4185,265777,237,551707,698,79802,220,032
4Jul 3, 2023 07:3085,269775,588,403707,734,44002,232,320
5Jul 3, 2023 07:3085,272794,250,012707,755,56602,228,224
6Jul 3, 2023 07:3685,294772,143,886707,936,74102,240,512
7Jul 3, 2023 07:3685,295775,938,204707,944,69502,228,224
8Jul 3, 2023 07:4185,296766,145,580707,955,38102,228,224
9Jul 3, 2023 07:3685,299771,303,584707,982,68302,228,224