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 listFeb 1, 2025 20:55E SequeiraE SequeiraScore: 76,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 20:5676,618660,411,190581,938,00053,994,0002,326,528
2Feb 1, 2025 20:5676,633664,940,812584,048,00052,004,0002,326,528
3Feb 1, 2025 20:5576,653670,018,013596,206,00040,013,0002,371,584
4Feb 1, 2025 20:5576,790668,803,026584,246,00053,113,0002,375,680
5Feb 1, 2025 20:5676,810663,121,501573,574,00063,952,0002,367,488
6Feb 1, 2025 20:5576,821661,757,286590,642,00046,971,0002,326,528