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 listOct 15, 2024 20:11Elnur RakhmatullinElnur RakhmatullinScore: 51,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:1151,883461,166,132427,632,0002,997,0002,277,376
2Oct 15, 2024 20:1151,885462,976,077429,643,000999,0002,277,376
3Oct 15, 2024 20:1151,887460,701,715425,666,0004,996,0002,277,376
4Oct 15, 2024 20:1151,890457,466,272427,693,0002,997,0002,273,280
5Oct 15, 2024 20:1151,899457,665,028428,765,0001,998,0002,277,376
6Oct 15, 2024 20:1151,905457,025,265426,814,0003,998,0002,277,376
7Oct 15, 2024 20:1151,908461,784,778427,840,0002,998,0002,293,760
8Oct 15, 2024 20:1151,913461,170,039429,878,000999,0002,277,376
9Oct 15, 2024 20:1151,959454,180,731431,257,00002,277,376