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 24, 2023 07:21Ignas BagdonasIgnas BagdonasScore: 19,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2023 07:2119,474192,571,554161,631,00002,441,216
2Aug 24, 2023 07:2119,481182,432,632159,693,0001,996,0002,527,232
3Aug 24, 2023 07:2119,531186,933,165160,105,0002,001,0002,527,232
4Aug 24, 2023 07:2119,548183,206,952162,250,00002,523,136
5Aug 24, 2023 07:2119,611190,362,905162,771,00002,523,136
6Aug 24, 2023 07:2119,612193,901,602160,780,0001,997,0002,527,232
7Aug 24, 2023 07:2119,615187,110,750161,804,000998,0002,527,232
8Aug 24, 2023 07:2119,740218,988,005163,845,67902,191,360
9Aug 24, 2023 07:2119,949189,422,234163,567,0002,006,0002,453,504
10Aug 24, 2023 07:2119,974195,255,347163,787,0001,997,0002,523,136
11Aug 24, 2023 07:2120,686224,013,663171,690,00702,191,360
12Aug 24, 2023 07:2120,710228,905,591171,891,49302,191,360