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 listJan 1, 2023 17:45Jack FrigaardJack FrigaardScore: 5,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2023 17:454,969103,698,90741,241,10102,203,648
2Jan 1, 2023 17:454,972105,807,40941,267,89602,203,648
3Jan 1, 2023 17:454,986115,620,75741,383,64702,207,744
4Jan 1, 2023 17:455,04175,290,86538,850,0002,988,0002,523,136
5Jan 1, 2023 17:455,04272,485,29139,855,0001,992,0002,523,136
6Jan 1, 2023 17:455,04566,065,22638,883,0002,991,0002,523,136
7Jan 1, 2023 17:455,04567,926,89039,882,0001,994,0002,453,504
8Jan 1, 2023 17:455,05663,721,17039,966,0001,998,0002,453,504
9Jan 1, 2023 17:455,06466,010,80940,031,0002,001,0002,453,504
10Jan 1, 2023 17:455,06566,397,32439,036,0003,002,0002,523,136
11Jan 1, 2023 17:455,06766,354,74740,058,0002,002,0002,523,136
12Jan 1, 2023 17:455,06964,081,95139,070,0003,005,0002,523,136