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 31, 2023 12:59Ignas BagdonasIgnas BagdonasScore: 16,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2023 12:5916,578164,046,569136,596,0001,004,0002,527,232
2Aug 31, 2023 12:5916,600169,699,943137,783,00002,527,232
3Aug 31, 2023 12:5916,604159,632,741136,812,000998,0002,523,136
4Aug 31, 2023 12:5916,721165,563,341136,789,0001,996,0002,527,232
5Aug 31, 2023 12:5916,722164,551,559137,798,000998,0002,445,312
6Aug 31, 2023 12:5916,723171,334,914137,805,000998,0002,523,136
7Aug 31, 2023 12:5916,777162,074,955139,245,00002,441,216
8Aug 31, 2023 12:5916,844169,984,322136,813,0002,995,0002,453,504
9Aug 31, 2023 12:5916,844166,015,745137,807,0001,997,0002,527,232
10Aug 31, 2023 12:5918,265222,986,203151,595,70402,187,264
11Aug 31, 2023 12:5918,270216,211,607151,638,62902,187,264
12Aug 31, 2023 12:5918,272210,738,629151,657,57402,183,168