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 6, 2025 09:53E SequeiraE SequeiraScore: 65,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 09:5365,047564,393,709478,899,00060,987,0002,289,664
2Feb 6, 2025 09:5265,074561,759,813482,102,00058,012,0002,392,064
3Feb 6, 2025 09:5265,084566,995,488486,181,00054,020,0002,289,664
4Feb 6, 2025 09:5265,306570,428,396482,035,00060,004,0002,478,080
5Feb 6, 2025 09:5365,333563,939,740474,231,00068,033,0002,375,680
6Feb 6, 2025 09:5365,497569,007,556474,671,00068,952,0002,289,664