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 listDec 29, 2025 08:59Aman | अमनAman | अमनScore: 523,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 08:59523,8174,374,732,5994,274,722,00072,961,0002,281,472
2Dec 29, 2025 08:59523,8484,379,511,1144,279,974,00067,967,0002,281,472
3Dec 29, 2025 08:59523,9164,372,853,8394,281,540,00066,961,0002,281,472
4Dec 29, 2025 08:59523,9164,375,294,4954,284,541,00063,963,0002,289,664
5Dec 29, 2025 08:59523,9224,374,487,0324,293,582,00054,969,0002,289,664
6Dec 29, 2025 08:59524,2054,378,285,8044,277,936,00072,964,0002,277,376
7Dec 29, 2025 08:59524,2724,378,045,8164,281,501,00069,959,0002,289,664
8Dec 29, 2025 08:59524,3524,374,858,3094,297,142,00054,976,0002,506,752
9Dec 29, 2025 08:59530,0994,430,453,4184,333,857,00065,967,0002,289,664