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 10, 2024 18:30Joad NacerJoad NacerScore: 7,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2024 18:307,600148,737,98463,078,58402,285,568
2Jun 10, 2024 18:307,650130,426,18863,495,98902,269,184
3Jun 10, 2024 18:307,718122,962,41464,055,37502,277,376
4Jun 10, 2024 18:307,90289,413,49065,583,00002,285,568
5Jun 10, 2024 18:307,90292,680,29864,576,0001,009,0002,273,280
6Jun 10, 2024 18:307,92794,933,90563,798,0001,993,0002,285,568
7Jun 10, 2024 18:307,92796,343,63663,801,0001,993,0002,285,568
8Jun 10, 2024 18:307,93090,315,38063,829,0001,994,0002,289,664
9Jun 10, 2024 18:307,93791,849,75063,877,0001,996,0002,277,376
10Jun 10, 2024 18:307,99391,263,45165,333,0001,005,0002,285,568
11Jun 10, 2024 18:308,02196,144,81665,569,0001,008,0002,285,568
12Jun 10, 2024 18:308,05989,505,22964,892,0001,996,0002,277,376