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 listNov 3, 2024 20:54Sergei YakovlevSergei YakovlevScore: 65,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2024 20:5465,554565,535,752459,084,00085,015,0002,400,256
2Nov 3, 2024 20:5465,598571,148,339464,543,00079,921,0002,404,352
3Nov 3, 2024 20:5465,620573,973,025470,696,00073,952,0002,412,544
4Nov 3, 2024 20:5465,671569,400,566461,060,00084,011,0002,285,568
5Nov 3, 2024 20:5465,709575,667,248457,325,00088,062,0002,416,640
6Nov 3, 2024 20:5465,716576,532,428479,390,00066,053,0002,277,376
7Nov 3, 2024 20:5465,767575,546,457475,880,00069,982,0002,277,376
8Nov 3, 2024 20:5465,848571,223,143454,616,00091,922,0002,285,568
9Nov 3, 2024 20:5465,913568,759,853486,069,00061,008,0002,277,376