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 19, 2026 16:23A_ShamanA_ShamanScore: 41,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:2341,566354,305,191282,741,00062,262,0002,113,536
2Jun 19, 2026 16:2341,596354,382,707282,895,00062,353,0002,113,536
3Jun 19, 2026 16:2341,756356,029,849283,876,00062,699,0002,113,536
4Jun 19, 2026 16:2341,769355,850,848282,736,00063,950,0002,113,536
5Jun 19, 2026 16:2341,798356,127,320283,646,00063,285,0002,113,536
6Jun 19, 2026 16:2341,815356,175,467283,869,00063,196,0002,113,536
7Jun 19, 2026 16:2341,817356,225,839283,019,00064,064,0002,113,536
8Jun 19, 2026 16:2341,835356,326,537283,325,00063,907,0002,113,536
9Jun 19, 2026 16:2341,923357,265,067283,476,00064,493,0002,113,536