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 listDec 1, 2025 19:24Rajarshi BasuRajarshi BasuScore: 11,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:2411,782128,668,14295,792,0001,995,0002,486,272
2Dec 1, 2025 19:2411,788121,568,87594,849,0002,995,0002,289,664
3Dec 1, 2025 19:2411,792127,134,43696,878,000998,0002,289,664
4Dec 1, 2025 19:2411,808123,644,77997,009,0001,000,0002,289,664
5Dec 1, 2025 19:2411,815123,849,14896,060,0002,001,0002,289,664
6Dec 1, 2025 19:2411,818122,262,09296,088,0002,001,0002,289,664
7Dec 1, 2025 19:2411,818121,668,72496,088,0002,001,0002,289,664
8Dec 1, 2025 19:2411,818120,953,31696,092,0002,001,0002,486,272
9Dec 1, 2025 19:2411,819125,207,02096,099,0002,002,0002,490,368
10Dec 1, 2025 19:2412,036124,298,62397,902,0001,998,0002,289,664
11Dec 1, 2025 19:2412,042125,982,55998,950,000999,0002,289,664
12Dec 1, 2025 19:2412,083128,002,83399,286,0001,002,0002,289,664