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 listJul 1, 2026 07:33Genos0Genos0Score: 74,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 07:3374,126624,722,610549,795,00065,453,0002,113,536
2Jul 1, 2026 07:3374,148624,885,428549,074,00066,358,0002,113,536
3Jul 1, 2026 07:3374,178625,097,132549,045,00066,637,0002,113,536
4Jul 1, 2026 07:3374,232625,733,907548,013,00068,119,0002,113,536
5Jul 1, 2026 07:3374,249625,673,050549,384,00066,886,0002,113,536
6Jul 1, 2026 07:3374,482627,529,048549,920,00068,285,0002,113,536
7Jul 1, 2026 07:3375,304634,313,416554,378,00070,647,0002,113,536
8Jul 1, 2026 07:3375,447635,864,649554,893,00071,318,0002,113,536
9Jul 1, 2026 07:3375,464635,666,098555,110,00071,243,0002,113,536