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 15, 2025 21:25Aryan JainAryan JainScore: 64,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2025 21:0264,678558,296,339472,851,00063,979,0002,453,504
2Aug 15, 2025 21:0264,714564,072,373473,114,00064,015,0002,285,568
3Aug 15, 2025 21:0264,743569,453,507477,327,00060,041,0002,465,792
4Aug 15, 2025 21:0264,754568,370,067482,516,00054,944,0002,289,664
5Aug 15, 2025 21:0264,844562,891,733486,188,00052,020,0002,445,312
6Aug 15, 2025 21:0264,855564,485,789483,268,00055,030,0002,457,600
7Aug 15, 2025 21:0264,859562,404,460485,294,00053,032,0002,289,664
8Aug 15, 2025 21:2564,967566,710,842479,205,00060,025,0002,453,504
9Aug 15, 2025 21:0265,019567,870,630484,693,00054,965,0002,289,664
10Aug 15, 2025 21:2565,022560,237,071483,715,00055,967,0002,449,408
11Aug 15, 2025 21:2565,055566,206,048478,959,00060,994,0002,453,504
12Aug 15, 2025 21:0265,066563,686,329479,043,00061,005,0002,285,568