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 listMay 3, 2024 12:14Steve HanSteve HanScore: 51,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2024 12:1551,805494,260,849429,985,08502,293,760
2May 3, 2024 12:1551,812479,947,241430,037,84102,289,664
3May 3, 2024 12:1451,822487,772,587430,123,53302,297,856
4May 3, 2024 12:1551,873499,884,128430,545,96202,289,664
5May 3, 2024 12:1551,890487,265,505430,683,22202,289,664
6May 3, 2024 12:1551,893497,126,654430,711,83902,289,664
7May 3, 2024 12:1451,926496,223,360430,987,06202,301,952
8May 3, 2024 12:1451,962493,308,403431,286,86202,281,472
9May 3, 2024 12:1552,095486,348,678432,385,81002,297,856