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 5, 2024 20:17AnSaAnSaScore: 22,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2024 20:1722,044278,190,566182,968,98502,293,760
2Jun 5, 2024 20:1722,377213,245,900184,735,000998,0002,273,280
3Jun 5, 2024 20:1722,380210,058,469183,758,0001,997,0002,273,280
4Jun 5, 2024 20:1722,382213,112,424184,772,000998,0002,273,280
5Jun 5, 2024 20:1722,383208,913,147183,786,0001,997,0002,273,280
6Jun 5, 2024 20:1722,403211,170,485183,947,0001,999,0002,269,184
7Jun 5, 2024 20:1722,582246,454,662187,427,07702,285,568
8Jun 5, 2024 20:1722,600244,602,157187,576,98802,293,760
9Jun 5, 2024 20:1722,622221,545,934186,762,000998,0002,273,280
10Jun 5, 2024 20:1722,887215,940,471187,966,0001,999,0002,273,280
11Jun 5, 2024 20:1722,889214,452,532186,978,0002,999,0002,273,280
12Jun 5, 2024 20:1722,899212,676,018188,064,0002,000,0002,273,280