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 23, 2026 15:53Kasper KivimäkiKasper KivimäkiScore: 63,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 15:5462,284526,826,766515,899,0001,061,0002,113,536
2Jul 23, 2026 15:5462,311527,044,760516,098,0001,091,0002,113,536
3Jul 23, 2026 15:5462,411528,686,360517,016,0001,003,0002,113,536
4Jul 23, 2026 15:5462,747530,662,780519,803,0001,001,0002,113,536
5Jul 23, 2026 15:5463,080533,484,692522,565,0001,006,0002,113,536
6Jul 23, 2026 15:5463,431536,354,884525,400,0001,083,0002,113,536
7Jul 23, 2026 15:5463,437537,199,920525,531,0001,003,0002,113,536
8Jul 23, 2026 15:5463,503536,931,042526,032,0001,049,0002,113,536
9Jul 23, 2026 15:5463,556538,149,291526,519,0001,004,0002,113,536