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 listJun 6, 2021 21:42Yuriy LyfenkoYuriy LyfenkoScore: 17,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 21:4217,562670,858,700143,772,0001,996,0002,523,136
2Jun 6, 2021 21:4217,567672,547,843143,805,0001,997,0002,260,992
3Jun 6, 2021 21:4217,568676,506,328143,818,0001,997,0002,260,992
4Jun 6, 2021 21:4217,570671,953,358144,832,000998,0002,383,872
5Jun 6, 2021 21:4217,571675,041,650143,844,0001,997,0002,260,992
6Jun 6, 2021 21:4217,572672,689,411143,849,0001,997,0002,260,992
7Jun 6, 2021 21:4217,572670,787,419143,850,0001,997,0002,260,992
8Jun 6, 2021 21:4217,586673,943,248143,962,0001,999,0002,260,992
9Jun 6, 2021 21:4217,588671,656,050143,981,0001,999,0002,260,992
10Jun 6, 2021 21:4218,172718,414,730150,824,06802,240,512
11Jun 6, 2021 21:4218,172701,883,061150,831,66102,240,512
12Jun 6, 2021 21:4218,176704,901,885150,860,10002,240,512