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 2, 2026 06:49Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 06:4901,001,263,316991,119,0001,084,0002,113,536expected "53683994127513125 ", got "s264 2476 A2511/2511 B3765/3766 C3693/3702 D3706/3713 E3708/3711 F3693/3693 G2541/2552 H3775/3780 I3875/3878 2460 "
2Oct 2, 2026 06:490996,070,023985,850,0001,054,0002,113,536expected "53695703630836142 ", got "s279 2484 A2506/2508 B3744/3748 C3672/3672 D3685/3686 E3687/3688 F3665/3669 G2535/2537 H3752/3756 I3868/3869 2452 "
3Oct 2, 2026 06:4901,001,626,048988,488,0001,064,0002,113,536expected "53681556782913693 ", got "s270 2480 A2511/2511 B3754/3755 C3682/3685 D3697/3702 E3696/3697 F3671/3671 G2539/2541 H3765/3766 I3872/3890 2458 "