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 3, 2025 06:20Zhiyang LuZhiyang LuScore: 390,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 06:20389,8893,263,557,0243,155,128,00080,951,0002,293,760
2Feb 3, 2025 06:20389,9303,262,152,7613,163,457,00072,964,0002,510,848
3Feb 3, 2025 06:20389,9583,262,457,6833,156,687,00079,966,0002,281,472
4Feb 3, 2025 06:20390,2213,266,863,9283,164,883,00073,950,0002,289,664
5Feb 3, 2025 06:20390,2453,263,529,4853,179,072,00059,963,0002,281,472
6Feb 3, 2025 06:20391,1383,273,466,7873,173,478,00072,965,0002,281,472
7Feb 3, 2025 06:20391,2863,280,632,6933,163,707,00083,965,0002,281,472
8Feb 3, 2025 06:20391,3923,279,344,9063,182,586,00065,970,0002,506,752
9Feb 3, 2025 06:20397,4073,331,055,7073,237,524,00060,953,0002,293,760