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 14:07alfaixalfaixScore: 155,813Success
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 14:07155,5711,321,535,9131,232,276,00058,965,0002,265,088
2Feb 22, 2025 14:07155,7131,315,677,3101,233,447,00058,973,0002,289,664
3Feb 22, 2025 14:07155,7361,321,111,8511,231,624,00060,981,0002,277,376
4Feb 22, 2025 14:07155,7901,321,685,8681,235,099,00057,957,0002,277,376
5Feb 22, 2025 14:07155,8131,320,447,7371,230,285,00062,963,0002,273,280
6Feb 22, 2025 14:07155,8981,327,704,7291,238,002,00055,954,0002,273,280
7Feb 22, 2025 14:07155,9071,327,001,2671,243,068,00050,961,0002,289,664
8Feb 22, 2025 14:07156,1531,324,928,0841,233,118,00062,954,0002,277,376
9Feb 22, 2025 14:07156,2661,321,703,8621,233,011,00064,000,0002,277,376