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 20:39alfaixalfaixScore: 119,065Success
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 20:39118,7591,008,646,187984,698,000999,0002,277,376
2Feb 22, 2025 20:39118,8601,014,549,289984,542,0001,999,0002,273,280
3Feb 22, 2025 20:39118,9951,016,360,515986,663,000999,0002,289,664
4Feb 22, 2025 20:39119,0061,015,309,018985,752,0001,999,0002,273,280
5Feb 22, 2025 20:39119,0651,020,509,113987,239,0001,000,0002,281,472
6Feb 22, 2025 20:39119,1171,016,209,252986,673,0001,999,0002,281,472
7Feb 22, 2025 20:39119,2001,021,604,397987,359,0001,998,0002,277,376
8Feb 22, 2025 20:39119,2291,012,494,059987,599,0001,999,0002,371,584
9Feb 22, 2025 20:39119,6441,026,139,192993,049,00002,289,664