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 listSep 6, 2026 03:08CheckHarryCheckHarryScore: 3,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:103,90242,458,61631,210,0001,179,0002,113,536
2Sep 6, 2026 03:103,90942,504,14631,284,0001,163,0002,113,536
3Sep 6, 2026 03:103,91042,742,90131,251,0001,204,0002,113,536
4Sep 6, 2026 03:103,91542,511,92031,316,0001,185,0002,113,536
5Sep 6, 2026 03:103,93042,776,08231,597,0001,022,0002,113,536
6Sep 6, 2026 03:103,99043,196,19231,936,0001,183,0002,113,536
7Sep 6, 2026 03:104,03243,547,53232,277,0001,189,0002,113,536
8Sep 6, 2026 03:104,08743,999,04132,743,0001,186,0002,113,536
9Sep 6, 2026 03:104,24846,118,71234,076,0001,184,0002,113,536