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 listJun 7, 2025 05:32limanjun99limanjun99Score: 58,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2025 05:3258,331517,043,461412,127,00072,022,0002,260,992
2Jun 7, 2025 05:3258,418513,143,501403,895,00080,978,0002,396,160
3Jun 7, 2025 05:3258,435507,303,944395,010,00090,002,0002,396,160
4Jun 7, 2025 05:3258,452506,348,482396,122,00089,027,0002,519,040
5Jun 7, 2025 05:3258,484512,571,538407,350,00078,067,0002,396,160
6Jun 7, 2025 05:3258,507514,017,460402,676,00082,933,0002,260,992
7Jun 7, 2025 05:3258,510510,794,535398,698,00086,934,0002,260,992
8Jun 7, 2025 05:3258,623514,256,734403,645,00082,927,0002,260,992
9Jun 7, 2025 05:3258,654511,587,259413,853,00072,974,0002,260,992