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 11:11VladislavVladislavScore: 2,068,352Success
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 11:112,063,93417,167,953,32017,052,689,00077,966,0002,265,088
2Aug 25, 2025 11:112,066,05017,177,509,94617,077,252,00070,967,0002,289,664
3Aug 25, 2025 11:112,066,97017,192,781,59317,092,880,00062,970,0002,277,376
4Aug 25, 2025 11:112,067,77417,202,848,65317,104,554,00057,971,0002,277,376
5Aug 25, 2025 11:112,068,35217,197,483,37917,101,356,00065,966,0002,277,376
6Aug 25, 2025 11:112,068,90617,206,321,34617,104,952,00066,968,0002,265,088
7Aug 25, 2025 11:112,069,32117,211,256,61017,104,405,00070,960,0002,277,376
8Aug 25, 2025 11:112,090,27617,381,410,47217,268,326,00080,964,0002,277,376
9Aug 25, 2025 11:112,159,86417,961,899,53317,864,905,00061,968,0002,277,376