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 listAug 25, 2025 14:33SSScore: 394,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 14:33394,3943,297,372,1573,203,507,00069,967,0002,281,472
2Aug 25, 2025 14:33394,6433,300,753,5013,211,566,00063,971,0002,506,752
3Aug 25, 2025 14:33394,6713,302,385,8283,215,813,00059,959,0002,289,664
4Aug 25, 2025 14:33394,8293,302,725,1913,222,112,00054,967,0002,506,752
5Aug 25, 2025 14:33394,9373,301,641,6013,198,029,00079,950,0002,506,752
6Aug 25, 2025 14:33395,5733,305,683,5383,209,297,00073,960,0002,506,752
7Aug 25, 2025 14:33396,8083,322,065,8673,227,533,00065,970,0002,289,664
8Aug 25, 2025 14:33396,9393,319,405,6003,219,628,00074,968,0002,289,664
9Aug 25, 2025 14:33412,7783,453,938,1523,344,101,00081,953,0002,289,664