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 22, 2026 15:45timothygktimothygkScore: 23,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 15:4522,775200,030,930135,878,00053,160,0002,117,632stderr
2Oct 22, 2026 15:4522,795200,602,042136,697,00052,506,0002,117,632stderr
3Oct 22, 2026 15:4522,876200,779,408136,938,00052,941,0002,121,728stderr
4Oct 22, 2026 15:4522,990201,851,792137,488,00053,337,0002,117,632stderr
5Oct 22, 2026 15:4523,076203,023,829136,582,00054,953,0002,117,632stderr
6Oct 22, 2026 15:4523,163203,183,966136,954,00055,300,0002,117,632stderr
7Oct 22, 2026 15:4523,215203,941,878137,627,00055,059,0002,121,728stderr
8Oct 22, 2026 15:4523,267204,591,304138,273,00054,851,0002,117,632stderr
9Oct 22, 2026 15:4524,402213,559,465149,097,00053,446,0002,117,632stderr