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 26, 2026 21:54Karthik ReddyKarthik ReddyScore: 4,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 21:554,60749,806,46737,198,0001,044,0002,113,536
2Sep 26, 2026 21:554,62248,627,74237,342,0001,028,0002,113,536
3Sep 26, 2026 21:554,62548,634,12037,364,0001,027,0002,113,536
4Sep 26, 2026 21:554,62748,691,76237,372,0001,033,0002,113,536
5Sep 26, 2026 21:554,62948,653,79537,386,0001,038,0002,113,536
6Sep 26, 2026 21:554,63048,686,39237,385,0001,050,0002,113,536
7Sep 26, 2026 21:554,63748,892,47037,417,0001,073,0002,113,536
8Sep 26, 2026 21:554,78850,235,57738,692,0001,054,0002,113,536
9Sep 26, 2026 21:554,80850,125,18738,878,0001,034,0002,113,536