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 08:00Karthik 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 08:0009,933,97601,232,0002,113,536expected "53686294009660774 ", got "268 134 KKIMIKMNKHISKIHHNMHKIXNHIIMIMKLOMIKHHGHKLHIHHHHLRHQLLKLIHORHHHOM "
2Oct 2, 2026 08:0009,867,99601,233,0002,113,536expected "53686835150907707 ", got "265 135 NLPIPLONIIQSNKKNIIMKIJIIIKMJLKIOLKMHHJJHHQHSHKHIWLHMMJHKHIUHHKLK "
3Oct 2, 2026 08:0009,925,07701,242,0002,113,536expected "53690587979007754 ", got "269 135 NIJHOIQOOMOWQLMPNJIKISIJHIPLNKJIHHIJHHJHLKKHHHLHRKHGTJGGGLJGOJPM "