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 2, 2024 19:03Bubble BoiBubble BoiScore: 58,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 19:0357,831551,818,073479,998,71002,228,224
2Feb 2, 2024 19:1557,832532,694,994480,007,80202,228,224
3Feb 2, 2024 19:1558,004546,873,516481,435,35702,236,416
4Feb 2, 2024 19:0358,253553,859,426483,497,23502,236,416
5Feb 2, 2024 19:0358,358549,354,071484,375,16402,232,320
6Feb 2, 2024 19:1558,529546,171,290485,790,78902,232,320