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 28, 2024 18:16RileyRileyScore: 149,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:16149,4661,266,859,5841,239,572,000999,0002,281,472
2Oct 28, 2024 18:16149,4831,263,908,3101,238,708,0001,999,0002,289,664
3Oct 28, 2024 18:16149,4831,266,531,5601,238,714,0001,999,0002,289,664
4Oct 28, 2024 18:16149,5031,267,906,6051,239,880,000999,0002,269,184
5Oct 28, 2024 18:16149,5081,266,623,4831,239,916,000999,0002,281,472
6Oct 28, 2024 18:16149,5181,271,461,3621,240,000,0001,000,0002,367,488
7Oct 28, 2024 18:16149,5201,272,186,6121,240,018,0001,000,0002,289,664
8Oct 28, 2024 18:16149,5251,266,553,7871,240,060,0001,000,0002,289,664
9Oct 28, 2024 18:16149,5451,273,521,3761,239,223,0001,998,0002,289,664