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 17, 2026 12:42timothygktimothygkScore: 39,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 12:4539,543339,674,685327,109,0001,100,0002,117,632stderr
2Oct 17, 2026 12:4539,547339,128,051327,158,0001,083,0002,117,632stderr
3Oct 17, 2026 12:4539,547340,321,460327,161,0001,080,0002,117,632stderr
4Oct 17, 2026 12:4539,549339,201,357327,170,0001,091,0002,117,632stderr
5Oct 17, 2026 12:4539,552339,238,222327,278,0001,008,0002,117,632stderr
6Oct 17, 2026 12:4539,556339,298,438327,317,0001,003,0002,117,632stderr
7Oct 17, 2026 12:4539,556339,258,857327,316,0001,005,0002,117,632stderr
8Oct 17, 2026 12:4539,587339,547,265327,464,0001,116,0002,117,632stderr
9Oct 17, 2026 12:4539,593339,578,399327,608,0001,014,0002,117,632stderr