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 listMay 4, 2026 12:20limanjun99limanjun99Score: 4,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 12:204,35054,523,57133,834,0002,275,0002,514,944
2May 4, 2026 12:204,41456,213,21033,303,0003,339,0002,494,464
3May 4, 2026 12:204,42554,771,22833,347,0003,382,0002,514,944
4May 4, 2026 12:204,43952,612,21533,547,0003,299,0002,510,848
5May 4, 2026 12:204,44151,962,37333,654,0003,212,0002,498,560
6May 4, 2026 12:204,46155,432,78633,711,0003,320,0002,502,656
7May 4, 2026 12:204,47454,644,22733,753,0003,386,0002,502,656
8May 4, 2026 12:204,48154,049,33033,907,0003,289,0002,494,464
9May 4, 2026 12:204,53555,076,48234,326,0003,316,0002,498,560