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 listAug 1, 2026 14:36George SeabridgeGeorge SeabridgeScore: 72,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 14:3760,216509,726,775498,727,0001,071,0002,113,536
2Aug 1, 2026 14:3760,312510,670,647499,514,0001,080,0002,113,536
3Aug 1, 2026 14:3760,433511,535,615500,511,0001,086,0002,113,536
4Aug 1, 2026 14:3760,739514,098,942503,054,0001,081,0002,113,536
5Aug 1, 2026 14:3772,381610,845,273599,672,0001,093,0002,113,536
6Aug 1, 2026 14:3772,901615,013,374604,049,0001,033,0002,113,536
7Aug 1, 2026 14:3773,537620,386,570609,281,0001,078,0002,113,536
8Aug 1, 2026 14:3786,164725,072,106714,068,0001,097,0002,113,536
9Aug 1, 2026 14:3788,074741,496,870729,944,0001,076,0002,113,536