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 20:01RyhbtRyhbtScore: 72,307Success
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 20:0172,275626,346,189597,884,0001,999,0002,281,472
2Aug 7, 2025 20:0172,292625,233,340597,020,0003,000,0002,281,472
3Aug 7, 2025 20:0172,295622,888,312598,049,0002,000,0002,506,752
4Aug 7, 2025 20:0172,303625,248,425598,113,0002,000,0002,506,752
5Aug 7, 2025 20:0172,307623,033,446598,149,0002,000,0002,281,472
6Aug 7, 2025 20:0172,328626,882,378598,318,0002,001,0002,510,848
7Aug 7, 2025 20:0172,336629,523,723597,393,0002,996,0002,502,656
8Aug 7, 2025 20:0172,363623,992,879597,615,0002,998,0002,506,752
9Aug 7, 2025 20:0172,435628,694,691598,209,0003,001,0002,510,848