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 14, 2026 13:55boop34boop34Score: 19,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 13:5519,839174,382,967163,640,0001,031,0002,113,536
2Jul 14, 2026 13:5519,845174,441,660163,646,0001,074,0002,113,536
3Jul 14, 2026 13:5519,845174,458,318163,664,0001,050,0002,113,536
4Jul 14, 2026 13:5519,846174,450,132163,685,0001,038,0002,113,536
5Jul 14, 2026 13:5519,847174,557,753163,679,0001,055,0002,113,536
6Jul 14, 2026 13:5519,861174,560,930163,840,0001,010,0002,113,536
7Jul 14, 2026 13:5519,864175,197,780163,793,0001,081,0002,113,536
8Jul 14, 2026 13:5519,865174,691,474163,881,0001,006,0002,113,536
9Jul 14, 2026 13:5519,868175,579,427163,828,0001,078,0002,113,536