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 22, 2025 19:25alfaixalfaixScore: 133,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 19:25133,6341,134,920,0501,107,162,0001,998,0002,281,472
2Feb 22, 2025 19:25133,6631,137,592,5621,108,406,000999,0002,289,664
3Feb 22, 2025 19:25133,7571,145,044,7811,110,179,00002,289,664
4Feb 22, 2025 19:25133,7881,134,608,9721,108,442,0001,998,0002,289,664
5Feb 22, 2025 19:25133,8241,133,600,6791,108,739,0001,999,0002,277,376
6Feb 22, 2025 19:25133,8251,136,109,8481,109,745,000999,0002,281,472
7Feb 22, 2025 19:25133,8901,139,780,0791,111,291,00002,273,280
8Feb 22, 2025 19:25133,9091,132,679,3141,109,446,0001,999,0002,281,472
9Feb 22, 2025 19:25134,0941,143,088,7281,107,980,0004,999,0002,281,472