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 listAug 22, 2025 06:37Ruoyu QiuRuoyu QiuScore: 62,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 06:3758,829513,008,371487,281,0001,000,0002,523,136
2Aug 22, 2025 06:3758,867514,789,378488,599,00002,273,280
3Aug 22, 2025 06:3758,867512,960,685487,597,000999,0002,273,280
4Aug 22, 2025 06:3762,878549,141,116518,887,0002,999,0002,273,280
5Aug 22, 2025 06:3762,883544,659,473518,927,0002,999,0002,273,280
6Aug 22, 2025 06:3762,900552,315,982519,067,0003,000,0002,506,752