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 11, 2026 20:29olliecrowolliecrowScore: 6,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 20:295,69773,277,93943,263,0004,024,0002,363,392
2Feb 11, 2026 20:295,83076,200,87945,366,0003,024,0002,273,280
3Feb 11, 2026 20:295,88673,516,87846,857,0001,993,0002,433,024
4Feb 11, 2026 20:296,02484,714,22048,003,0002,000,0002,514,944
5Feb 11, 2026 20:296,13078,278,62945,791,0005,087,0002,293,760
6Feb 11, 2026 20:296,19876,349,08948,415,0003,025,0002,387,968