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 22, 2025 18:43alfaixalfaixError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 18:4300000Error: No answer to stdout. Died or killed?
2Feb 22, 2025 18:43152,5711,288,612,3131,264,341,0001,998,0002,269,184
3Feb 22, 2025 18:43152,5711,289,229,4621,264,344,0001,998,0002,277,376
4Feb 22, 2025 18:43152,5811,290,696,0501,264,423,0001,999,0002,289,664
5Feb 22, 2025 18:43152,5831,292,753,4561,263,437,0002,998,0002,289,664
6Feb 22, 2025 18:43152,5831,294,150,0831,264,441,0001,999,0002,277,376
7Feb 22, 2025 18:43152,5871,290,796,3171,264,476,0001,999,0002,277,376
8Feb 22, 2025 18:43152,6741,299,136,6031,264,193,0002,998,0002,277,376
9Feb 22, 2025 18:43152,6841,296,820,2731,263,277,0003,997,0002,277,376
10Feb 22, 2025 18:43152,6951,289,977,9671,264,370,0002,998,0002,277,376