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 listJan 5, 2025 01:44Christopher MullinsChristopher MullinsScore: 70,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 01:4870,915617,361,274586,594,0001,998,0002,355,200
2Jan 5, 2025 01:5570,935618,899,921585,761,0002,998,0002,355,200
3Jan 5, 2025 01:5570,937617,268,562586,778,0001,999,0002,355,200
4Jan 5, 2025 01:4870,940617,516,506585,800,0002,998,0002,355,200
5Jan 5, 2025 01:4870,964617,919,710585,001,0004,000,0002,355,200
6Jan 5, 2025 01:4470,967615,917,117586,028,0003,000,0002,355,200
7Jan 5, 2025 01:4471,134617,604,441588,412,0001,998,0002,355,200
8Jan 5, 2025 01:5571,206618,622,114589,007,0002,000,0002,383,872
9Jan 5, 2025 01:4471,508618,723,714593,519,00002,359,296