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 9, 2025 01:32Code HintsCode HintsScore: 72,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 01:3272,420626,439,013601,086,00002,273,280
2Feb 9, 2025 01:3272,436630,589,259600,215,0001,000,0002,437,120
3Feb 9, 2025 01:3272,745627,696,488601,786,0001,999,0002,535,424
4Feb 9, 2025 01:3272,755628,211,722601,868,0001,999,0002,535,424
5Feb 9, 2025 01:3272,764630,575,027600,940,0002,999,0002,535,424
6Feb 9, 2025 01:3272,769627,671,525603,984,00002,441,216
7Feb 9, 2025 01:3272,780627,099,588602,074,0002,000,0002,437,120
8Feb 9, 2025 01:3272,789625,692,215603,152,0001,000,0002,273,280
9Feb 9, 2025 01:3272,790627,191,152602,160,0002,000,0002,535,424