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 listJul 13, 2024 03:02bgimby-nsbgimby-nsScore: 470,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2024 03:02470,9143,963,155,9353,908,584,67302,252,800
2Jul 13, 2024 03:02470,9653,967,971,8433,909,011,76602,375,680
3Jul 13, 2024 03:02472,3803,979,438,8893,920,754,97302,244,608