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 08:37Erdem KeskinErdem KeskinScore: 83,900Success
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:1883,885783,582,422696,245,56202,236,416
2Jul 3, 2023 08:3783,893770,901,371696,314,71002,232,320
3Jul 3, 2023 07:1883,897764,420,257696,349,15302,236,416
4Jul 3, 2023 08:3583,900755,847,663696,369,61902,236,416
5Jul 3, 2023 08:3583,900765,450,905696,373,16902,232,320
6Jul 3, 2023 08:3783,903762,770,827696,397,58402,244,608
7Jul 3, 2023 07:1883,906754,814,028696,422,74402,232,320
8Jul 3, 2023 08:3583,913758,855,659696,476,14402,240,512
9Jul 3, 2023 08:3784,080751,731,983697,861,40602,232,320