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 14:53Bernard TeoBernard TeoScore: 6,458Success
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 14:536,289106,829,43952,195,91902,281,472
2Jun 5, 2024 14:536,290118,698,01252,207,95702,293,760
3Jun 5, 2024 14:536,296112,448,77552,258,60102,281,472
4Jun 5, 2024 14:536,44779,757,50252,503,0001,009,0002,273,280
5Jun 5, 2024 14:536,44976,246,91053,530,00002,510,848
6Jun 5, 2024 14:536,45079,701,49653,533,00002,273,280
7Jun 5, 2024 14:536,45179,857,61752,531,0001,010,0002,273,280
8Jun 5, 2024 14:536,45881,330,96551,617,0001,985,0002,273,280
9Jun 5, 2024 14:536,45982,458,59252,598,0001,011,0002,256,896
10Jun 5, 2024 14:536,46181,115,97553,623,00002,396,160
11Jun 5, 2024 14:536,46278,174,14053,634,00002,273,280
12Jun 5, 2024 14:536,46380,532,38952,633,0001,012,0002,396,160
13Jun 5, 2024 14:536,46482,930,52552,639,0001,012,0002,273,280
14Jun 5, 2024 14:536,46480,115,20353,651,00002,396,160
15Jun 5, 2024 14:536,48580,022,61952,826,000996,0002,273,280