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 20, 2026 20:56allllekssssaallllekssssaScore: 2,042,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 20:592,040,04816,942,968,25816,865,365,00067,039,0002,113,536
2Jul 20, 2026 20:592,041,32516,952,898,82216,878,961,00064,038,0002,113,536
3Jul 20, 2026 20:592,041,75016,957,697,04416,880,456,00066,072,0002,113,536
4Jul 20, 2026 20:592,042,52316,962,857,25816,889,908,00063,040,0002,113,536
5Jul 20, 2026 20:592,042,52516,962,852,04616,888,837,00064,125,0002,113,536
6Jul 20, 2026 20:592,042,72816,965,165,55116,887,492,00067,154,0002,113,536
7Jul 20, 2026 20:592,046,09016,993,194,81216,919,515,00063,039,0002,113,536
8Jul 20, 2026 20:592,047,96617,007,971,12416,932,088,00066,037,0002,113,536
9Jul 20, 2026 20:592,181,72618,118,950,91818,044,153,00064,174,0002,113,536