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 23, 2025 21:16alfaixalfaixScore: 64,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 21:1664,272562,519,114530,464,0002,996,0002,281,472
2Feb 23, 2025 21:1664,284560,247,981531,560,0001,998,0002,273,280
3Feb 23, 2025 21:1664,285562,342,261531,568,0001,998,0002,281,472
4Feb 23, 2025 21:1664,287564,004,454531,583,0001,998,0002,281,472
5Feb 23, 2025 21:1664,289555,980,481531,604,0001,998,0002,281,472
6Feb 23, 2025 21:1664,307555,676,761530,753,0002,998,0002,289,664
7Feb 23, 2025 21:1664,311561,746,917528,787,0004,997,0002,269,184
8Feb 23, 2025 21:1664,325557,806,681532,897,000999,0002,265,088
9Feb 23, 2025 21:1664,377557,291,399533,333,0001,000,0002,277,376