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 7, 2024 12:34NoSIMD_C#NoSIMD_C#Score: 81,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 12:3481,124703,390,055615,298,00058,028,0002,535,424
2Nov 7, 2024 12:3481,147704,466,346615,474,00058,044,0002,428,928
3Nov 7, 2024 12:3481,167699,016,079611,719,00061,971,0002,293,760
4Nov 7, 2024 12:3481,181703,991,891615,817,00057,982,0002,293,760
5Nov 7, 2024 12:3481,207699,269,364614,014,00060,001,0002,301,952
6Nov 7, 2024 12:3481,220708,529,144612,113,00062,011,0002,293,760
7Nov 7, 2024 12:3481,224698,114,690618,148,00056,013,0002,293,760
8Nov 7, 2024 12:3481,558705,519,773615,939,00060,994,0002,547,712
9Nov 7, 2024 12:3481,671703,249,062629,876,00047,990,0002,293,760