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 12, 2024 05:24NoSIMD_C#NoSIMD_C#Score: 282,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 05:24281,7712,370,315,2722,204,775,000133,925,0002,355,200
2Nov 11, 2024 05:57281,9582,370,402,2812,230,379,000109,870,0002,420,736
3Nov 11, 2024 05:57281,9642,373,802,3812,229,382,000110,919,0002,469,888
4Nov 12, 2024 05:24282,2562,369,542,3202,236,829,000105,897,0002,355,200
5Nov 11, 2024 05:57283,2502,383,269,5832,262,048,00088,923,0002,351,104
6Nov 12, 2024 05:24283,7952,383,948,7102,237,575,000117,924,0002,527,232