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 listFeb 3, 2026 12:52RuszrokRuszrokScore: 36,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 12:5235,492321,044,700293,587,000998,0002,392,064
2Feb 3, 2026 12:5235,506316,832,926293,698,000998,0002,400,256
3Feb 3, 2026 12:5235,519319,963,641292,807,0001,998,0002,277,376
4Feb 3, 2026 12:5235,591322,235,700294,402,0001,001,0002,400,256
5Feb 3, 2026 12:5236,019322,653,891297,955,000999,0002,273,280
6Feb 3, 2026 12:5236,325331,302,353300,503,000998,0002,400,256
7Feb 3, 2026 12:5236,326327,494,453301,506,00002,400,256
8Feb 3, 2026 12:5236,350331,542,674299,707,0001,998,0002,277,376
9Feb 3, 2026 12:5236,367324,391,058299,845,0001,998,0002,392,064