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 listOct 1, 2025 20:40Nguyễn Minh Nhật NoéNguyễn Minh Nhật NoéScore: 2,068,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2025 20:402,065,70717,182,949,86417,077,400,00067,969,0002,260,992
2Oct 1, 2025 20:402,065,98017,184,442,12517,077,667,00069,969,0002,277,376
3Oct 1, 2025 20:402,066,19917,177,692,11017,086,479,00062,972,0002,277,376
4Oct 1, 2025 20:402,067,50617,194,054,80617,086,339,00073,962,0002,277,376
5Oct 1, 2025 20:402,068,25517,199,071,39717,105,547,00060,966,0002,277,376
6Oct 1, 2025 20:402,068,32317,203,747,87717,112,113,00054,971,0002,289,664
7Oct 1, 2025 20:402,069,34017,211,479,37317,106,561,00068,965,0002,260,992
8Oct 1, 2025 20:402,071,41417,225,144,19317,132,768,00059,967,0002,265,088
9Oct 1, 2025 20:402,079,96317,301,293,37317,195,720,00067,971,0002,285,568