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 6, 2024 16:07eldon-chungeldon-chungScore: 47,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2024 16:0745,808455,882,746380,205,45502,293,760
2Jun 6, 2024 16:0245,816439,856,972380,269,91502,293,760
3Jun 6, 2024 16:0745,828456,748,388380,369,00602,301,952
4Jun 6, 2024 16:0747,342445,223,419392,937,37002,289,664
5Jun 6, 2024 16:0247,343448,961,719392,945,09302,293,760
6Jun 6, 2024 16:0247,350453,544,545393,002,03102,301,952
7Jun 6, 2024 16:0747,356454,041,750393,053,40102,301,952
8Jun 6, 2024 16:0747,364455,515,363393,124,33902,293,760
9Jun 6, 2024 16:0747,366452,542,115393,137,97702,281,472
10Jun 6, 2024 16:0748,634465,771,126403,663,93202,289,664
11Jun 6, 2024 16:0748,659469,921,706403,873,38802,301,952
12Jun 6, 2024 16:0748,669462,861,308403,950,30702,297,856