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 15, 2026 14:33timothygktimothygkScore: 41,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 14:3341,201352,562,589340,904,0001,070,0002,117,632stderr
2Oct 15, 2026 14:3341,222352,673,942341,139,0001,005,0002,117,632stderr
3Oct 15, 2026 14:3341,738357,693,969345,411,0001,019,0002,117,632stderr
4Oct 15, 2026 14:3341,888358,310,371346,669,0001,005,0002,117,632stderr
5Oct 15, 2026 14:3341,906359,090,132346,813,0001,011,0002,117,632stderr
6Oct 15, 2026 14:3341,917358,644,511346,821,0001,096,0002,117,632stderr
7Oct 15, 2026 14:3341,919359,141,081346,828,0001,106,0002,117,632stderr
8Oct 15, 2026 14:3342,169361,324,079348,997,0001,008,0002,117,632stderr
9Oct 15, 2026 14:3342,197361,439,063349,125,0001,112,0002,117,632stderr