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 7, 2025 05:47RyhbtRyhbtScore: 72,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2025 05:4772,276620,691,852598,888,000999,0002,359,296
2Aug 7, 2025 05:4772,290625,509,743598,005,0002,000,0002,281,472
3Aug 7, 2025 05:4772,294631,732,671598,040,0002,000,0002,281,472
4Aug 7, 2025 05:4772,294628,485,859597,042,0003,000,0002,277,376
5Aug 7, 2025 05:4772,296631,210,841596,054,0004,000,0002,506,752
6Aug 7, 2025 05:4772,308625,413,687598,154,0002,000,0002,519,040
7Aug 7, 2025 05:4772,309622,070,470599,167,0001,000,0002,351,104
8Aug 7, 2025 05:4772,342623,666,782597,443,0002,997,0002,289,664
9Aug 7, 2025 05:4772,473626,167,329599,524,0001,998,0002,502,656