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 19:43alfaixalfaixScore: 132,886Success
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 19:43132,8251,132,515,7561,100,451,0001,999,0002,269,184
2Feb 22, 2025 19:43132,8351,128,466,9721,101,530,000999,0002,281,472
3Feb 22, 2025 19:43132,8651,131,817,0101,100,779,0001,999,0002,281,472
4Feb 22, 2025 19:43132,8791,133,298,9391,101,898,000999,0002,289,664
5Feb 22, 2025 19:43132,8861,126,758,5961,101,954,000999,0002,269,184
6Feb 22, 2025 19:43132,9111,131,258,7591,102,162,000999,0002,281,472
7Feb 22, 2025 19:43132,9141,130,738,6401,102,184,000999,0002,281,472
8Feb 22, 2025 19:43132,9231,133,240,4451,101,261,0001,998,0002,289,664
9Feb 22, 2025 19:43132,9391,127,467,5871,101,399,0001,998,0002,293,760