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 listJun 5, 2026 11:28chereshnya123chereshnya123Score: 59,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:2859,156500,100,414434,764,00056,236,0002,113,536
2Jun 5, 2026 11:2859,168500,229,912434,840,00056,262,0002,113,536
3Jun 5, 2026 11:2859,196500,518,952435,042,00056,285,0002,113,536
4Jun 5, 2026 11:2859,210500,499,256435,199,00056,251,0002,113,536
5Jun 5, 2026 11:2859,221500,913,274435,297,00056,242,0002,113,536
6Jun 5, 2026 11:2859,255501,013,685434,614,00057,203,0002,113,536
7Jun 5, 2026 11:2859,280501,074,497434,785,00057,245,0002,113,536
8Jun 5, 2026 11:2859,281501,489,490435,834,00056,199,0002,113,536
9Jun 5, 2026 11:2859,410502,147,782434,882,00058,229,0002,113,536