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 17:36timothygktimothygkScore: 15,805Success
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 17:3715,642140,894,61899,706,00030,130,0002,117,632stderr
2Oct 22, 2026 17:3715,776141,968,052100,462,00030,485,0002,117,632stderr
3Oct 22, 2026 17:3715,782142,072,539100,380,00030,613,0002,117,632stderr
4Oct 22, 2026 17:3715,795142,582,101100,314,00030,788,0002,117,632stderr
5Oct 22, 2026 17:3715,805142,127,108100,502,00030,686,0002,117,632stderr
6Oct 22, 2026 17:3715,817142,244,697100,787,00030,499,0002,117,632stderr
7Oct 22, 2026 17:3715,837142,475,458100,856,00030,592,0002,117,632stderr
8Oct 22, 2026 17:3715,859142,849,750100,468,00031,162,0002,117,632stderr
9Oct 22, 2026 17:3715,900143,422,775100,321,00031,649,0002,117,632stderr