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 listApr 22, 2026 11:02wnwnScore: 3,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:033,42144,096,92427,381,0001,014,0002,310,144
2Apr 22, 2026 11:033,46845,322,99027,764,0001,028,0002,486,272
3Apr 22, 2026 11:033,47148,508,20726,825,0001,987,0002,486,272
4Apr 22, 2026 11:033,47646,100,38926,869,0001,990,0002,330,624
5Apr 22, 2026 11:033,47945,270,32826,887,0001,991,0002,482,176
6Apr 22, 2026 11:033,48243,501,98126,911,0001,993,0002,486,272
7Apr 22, 2026 11:033,49047,063,09426,972,0001,997,0002,482,176
8Apr 22, 2026 11:033,58143,651,61129,730,00002,482,176
9Apr 22, 2026 11:033,58847,358,89927,799,0001,985,0002,555,904