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 11, 2025 02:13RyhbtRyhbtScore: 53,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 02:1353,875470,655,917446,162,0001,000,0002,277,376
2Aug 11, 2025 02:1353,890469,976,238446,284,0001,000,0002,281,472
3Aug 11, 2025 02:1353,914478,435,185445,483,0002,002,0002,281,472
4Aug 11, 2025 02:1353,916473,260,390444,510,0002,996,0002,281,472
5Aug 11, 2025 02:1353,929475,191,182445,609,0001,998,0002,514,944
6Aug 11, 2025 02:1353,932470,479,562444,642,0002,997,0002,527,232
7Aug 11, 2025 02:1353,932473,490,566445,636,0001,998,0002,281,472
8Aug 11, 2025 02:1353,934478,438,479444,657,0002,997,0002,277,376
9Aug 11, 2025 02:1353,940472,546,747445,706,0001,998,0002,527,232